./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi009_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_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi009_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya --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 6efd977ba774fd706e089a911dcd82549d76c764859cf8b84047b990ab28d067 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:03:47,986 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:03:48,050 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 04:03:48,054 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:03:48,055 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:03:48,079 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:03:48,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:03:48,080 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:03:48,081 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:03:48,081 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:03:48,082 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:03:48,082 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:03:48,083 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:03:48,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:03:48,084 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:03:48,084 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:03:48,085 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:03:48,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:03:48,086 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:03:48,086 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:03:48,087 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:03:48,088 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:03:48,088 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:03:48,089 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:03:48,089 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:03:48,089 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:03:48,090 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:03:48,090 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:03:48,091 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:03:48,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:03:48,091 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:03:48,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:03:48,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:03:48,092 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:03:48,092 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:03:48,093 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:03:48,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:03:48,093 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:03:48,093 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:03:48,093 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:03:48,094 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:03:48,094 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_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 6efd977ba774fd706e089a911dcd82549d76c764859cf8b84047b990ab28d067 [2023-11-29 04:03:48,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:03:48,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:03:48,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:03:48,336 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:03:48,336 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:03:48,338 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/rfi009_rmo.oepc.i [2023-11-29 04:03:51,198 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:03:51,443 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:03:51,444 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/sv-benchmarks/c/pthread-wmm/rfi009_rmo.oepc.i [2023-11-29 04:03:51,459 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/data/f3841b6b3/798797cd78e843feb6e772e1d57fde0b/FLAG7b90eed8e [2023-11-29 04:03:51,471 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/data/f3841b6b3/798797cd78e843feb6e772e1d57fde0b [2023-11-29 04:03:51,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:03:51,474 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:03:51,476 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:03:51,476 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:03:51,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:03:51,481 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:03:51" (1/1) ... [2023-11-29 04:03:51,482 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@716592f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:03:51, skipping insertion in model container [2023-11-29 04:03:51,482 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:03:51" (1/1) ... [2023-11-29 04:03:51,534 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:03:51,859 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:03:51,870 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:03:51,929 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:03:51,959 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:03:51,960 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:03:51,965 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:03:51,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:03:51 WrapperNode [2023-11-29 04:03:51,966 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:03:51,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:03:51,967 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:03:51,967 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:03:51,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:03:51" (1/1) ... [2023-11-29 04:03:51,990 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:03:51" (1/1) ... [2023-11-29 04:03:52,014 INFO L138 Inliner]: procedures = 176, calls = 74, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 140 [2023-11-29 04:03:52,015 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:03:52,015 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:03:52,015 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:03:52,015 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:03:52,024 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:03:51" (1/1) ... [2023-11-29 04:03:52,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:03:51" (1/1) ... [2023-11-29 04:03:52,028 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:03:51" (1/1) ... [2023-11-29 04:03:52,049 INFO L175 MemorySlicer]: Split 24 memory accesses to 5 slices as follows [2, 1, 19, 1, 1]. 79 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1, 0, 0]. The 10 writes are split as follows [0, 1, 7, 1, 1]. [2023-11-29 04:03:52,049 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:03:51" (1/1) ... [2023-11-29 04:03:52,049 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:03:51" (1/1) ... [2023-11-29 04:03:52,061 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:03:51" (1/1) ... [2023-11-29 04:03:52,063 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:03:51" (1/1) ... [2023-11-29 04:03:52,066 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:03:51" (1/1) ... [2023-11-29 04:03:52,069 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:03:51" (1/1) ... [2023-11-29 04:03:52,074 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:03:52,075 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:03:52,075 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:03:52,075 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:03:52,076 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:03:51" (1/1) ... [2023-11-29 04:03:52,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:03:52,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:03:52,098 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:03:52,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:03:52,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 04:03:52,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 04:03:52,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 04:03:52,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 04:03:52,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 04:03:52,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 04:03:52,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 04:03:52,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 04:03:52,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 04:03:52,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 04:03:52,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 04:03:52,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:03:52,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:03:52,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:03:52,131 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 04:03:52,131 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 04:03:52,131 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 04:03:52,132 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 04:03:52,132 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 04:03:52,132 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 04:03:52,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:03:52,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 04:03:52,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 04:03:52,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 04:03:52,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 04:03:52,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 04:03:52,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:03:52,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:03:52,135 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 04:03:52,297 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:03:52,300 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:03:52,757 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:03:53,232 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:03:53,232 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 04:03:53,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:03:53 BoogieIcfgContainer [2023-11-29 04:03:53,233 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:03:53,235 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:03:53,236 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:03:53,239 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:03:53,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:03:51" (1/3) ... [2023-11-29 04:03:53,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@551183b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:03:53, skipping insertion in model container [2023-11-29 04:03:53,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:03:51" (2/3) ... [2023-11-29 04:03:53,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@551183b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:03:53, skipping insertion in model container [2023-11-29 04:03:53,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:03:53" (3/3) ... [2023-11-29 04:03:53,241 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi009_rmo.oepc.i [2023-11-29 04:03:53,261 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:03:53,261 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2023-11-29 04:03:53,261 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 04:03:53,364 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 04:03:53,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 88 transitions, 188 flow [2023-11-29 04:03:53,431 INFO L124 PetriNetUnfolderBase]: 2/85 cut-off events. [2023-11-29 04:03:53,432 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:03:53,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 85 events. 2/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 285 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2023-11-29 04:03:53,437 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 88 transitions, 188 flow [2023-11-29 04:03:53,442 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 85 transitions, 179 flow [2023-11-29 04:03:53,450 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:03:53,456 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;@30b8129, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:03:53,456 INFO L358 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2023-11-29 04:03:53,460 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 04:03:53,460 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 04:03:53,460 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:03:53,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:03:53,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 04:03:53,461 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:03:53,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:53,466 INFO L85 PathProgramCache]: Analyzing trace with hash 23498, now seen corresponding path program 1 times [2023-11-29 04:03:53,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:03:53,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425629345] [2023-11-29 04:03:53,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:03:53,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:03:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:03:53,698 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-29 04:03:53,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:03:53,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425629345] [2023-11-29 04:03:53,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425629345] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:03:53,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:03:53,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:03:53,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007265684] [2023-11-29 04:03:53,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:03:53,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:03:53,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:03:53,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:03:53,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:03:53,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 88 [2023-11-29 04:03:53,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 85 transitions, 179 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:53,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:03:53,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 88 [2023-11-29 04:03:53,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:03:56,083 INFO L124 PetriNetUnfolderBase]: 9214/14346 cut-off events. [2023-11-29 04:03:56,084 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-29 04:03:56,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27439 conditions, 14346 events. 9214/14346 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 1466. Compared 119273 event pairs, 7964 based on Foata normal form. 500/7829 useless extension candidates. Maximal degree in co-relation 27425. Up to 11276 conditions per place. [2023-11-29 04:03:56,236 INFO L140 encePairwiseOnDemand]: 63/88 looper letters, 53 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2023-11-29 04:03:56,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 78 transitions, 275 flow [2023-11-29 04:03:56,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:03:56,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:03:56,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2023-11-29 04:03:56,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-29 04:03:56,249 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 176 transitions. [2023-11-29 04:03:56,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 176 transitions. [2023-11-29 04:03:56,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:03:56,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 176 transitions. [2023-11-29 04:03:56,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 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-29 04:03:56,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:56,260 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:56,262 INFO L175 Difference]: Start difference. First operand has 93 places, 85 transitions, 179 flow. Second operand 3 states and 176 transitions. [2023-11-29 04:03:56,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 78 transitions, 275 flow [2023-11-29 04:03:56,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 78 transitions, 272 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 04:03:56,271 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 132 flow [2023-11-29 04:03:56,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2023-11-29 04:03:56,277 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -23 predicate places. [2023-11-29 04:03:56,277 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 132 flow [2023-11-29 04:03:56,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:56,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:03:56,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 04:03:56,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:03:56,278 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:03:56,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:56,279 INFO L85 PathProgramCache]: Analyzing trace with hash 23499, now seen corresponding path program 1 times [2023-11-29 04:03:56,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:03:56,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321552891] [2023-11-29 04:03:56,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:03:56,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:03:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:03:56,376 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-29 04:03:56,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:03:56,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321552891] [2023-11-29 04:03:56,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321552891] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:03:56,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:03:56,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:03:56,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058377535] [2023-11-29 04:03:56,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:03:56,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:03:56,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:03:56,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:03:56,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:03:56,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2023-11-29 04:03:56,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 132 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-29 04:03:56,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:03:56,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2023-11-29 04:03:56,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:03:58,625 INFO L124 PetriNetUnfolderBase]: 9214/14345 cut-off events. [2023-11-29 04:03:58,625 INFO L125 PetriNetUnfolderBase]: For 250/250 co-relation queries the response was YES. [2023-11-29 04:03:58,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27686 conditions, 14345 events. 9214/14345 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 1466. Compared 119182 event pairs, 7964 based on Foata normal form. 1/7329 useless extension candidates. Maximal degree in co-relation 27675. Up to 11275 conditions per place. [2023-11-29 04:03:58,717 INFO L140 encePairwiseOnDemand]: 85/88 looper letters, 52 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2023-11-29 04:03:58,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 77 transitions, 272 flow [2023-11-29 04:03:58,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:03:58,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:03:58,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2023-11-29 04:03:58,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2023-11-29 04:03:58,720 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 136 transitions. [2023-11-29 04:03:58,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 136 transitions. [2023-11-29 04:03:58,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:03:58,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 136 transitions. [2023-11-29 04:03:58,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:58,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:58,724 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:58,725 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 132 flow. Second operand 3 states and 136 transitions. [2023-11-29 04:03:58,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 77 transitions, 272 flow [2023-11-29 04:03:58,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 77 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:03:58,747 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 130 flow [2023-11-29 04:03:58,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2023-11-29 04:03:58,749 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -24 predicate places. [2023-11-29 04:03:58,749 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 130 flow [2023-11-29 04:03:58,749 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-29 04:03:58,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:03:58,749 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:03:58,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:03:58,750 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:03:58,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:58,750 INFO L85 PathProgramCache]: Analyzing trace with hash 700804751, now seen corresponding path program 1 times [2023-11-29 04:03:58,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:03:58,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247173849] [2023-11-29 04:03:58,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:03:58,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:03:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:03:58,801 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-29 04:03:58,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:03:58,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247173849] [2023-11-29 04:03:58,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247173849] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:03:58,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:03:58,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:03:58,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330502292] [2023-11-29 04:03:58,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:03:58,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:03:58,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:03:58,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:03:58,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:03:58,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 88 [2023-11-29 04:03:58,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:58,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:03:58,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 88 [2023-11-29 04:03:58,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:00,615 INFO L124 PetriNetUnfolderBase]: 9218/14344 cut-off events. [2023-11-29 04:04:00,615 INFO L125 PetriNetUnfolderBase]: For 250/250 co-relation queries the response was YES. [2023-11-29 04:04:00,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27694 conditions, 14344 events. 9218/14344 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 1466. Compared 119825 event pairs, 5720 based on Foata normal form. 0/7336 useless extension candidates. Maximal degree in co-relation 27683. Up to 11278 conditions per place. [2023-11-29 04:04:00,681 INFO L140 encePairwiseOnDemand]: 85/88 looper letters, 53 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2023-11-29 04:04:00,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 76 transitions, 272 flow [2023-11-29 04:04:00,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:04:00,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:04:00,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2023-11-29 04:04:00,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075757575757576 [2023-11-29 04:04:00,683 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 134 transitions. [2023-11-29 04:04:00,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 134 transitions. [2023-11-29 04:04:00,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:00,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 134 transitions. [2023-11-29 04:04:00,685 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-29 04:04:00,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:00,686 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:00,687 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 130 flow. Second operand 3 states and 134 transitions. [2023-11-29 04:04:00,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 76 transitions, 272 flow [2023-11-29 04:04:00,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 76 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:04:00,699 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 128 flow [2023-11-29 04:04:00,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, 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-29 04:04:00,700 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -25 predicate places. [2023-11-29 04:04:00,700 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 128 flow [2023-11-29 04:04:00,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:00,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:00,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:04:00,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:04:00,701 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:00,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:00,702 INFO L85 PathProgramCache]: Analyzing trace with hash 700804752, now seen corresponding path program 1 times [2023-11-29 04:04:00,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:04:00,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657138131] [2023-11-29 04:04:00,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:00,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:04:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:00,769 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-29 04:04:00,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:04:00,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657138131] [2023-11-29 04:04:00,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657138131] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:00,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:00,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:04:00,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096432392] [2023-11-29 04:04:00,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:00,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:04:00,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:04:00,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:04:00,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:04:00,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2023-11-29 04:04:00,785 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.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-29 04:04:00,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:00,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2023-11-29 04:04:00,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:02,200 INFO L124 PetriNetUnfolderBase]: 9214/14334 cut-off events. [2023-11-29 04:04:02,200 INFO L125 PetriNetUnfolderBase]: For 254/254 co-relation queries the response was YES. [2023-11-29 04:04:02,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27679 conditions, 14334 events. 9214/14334 cut-off events. For 254/254 co-relation queries the response was YES. Maximal size of possible extension queue 1466. Compared 119885 event pairs, 6280 based on Foata normal form. 5/7334 useless extension candidates. Maximal degree in co-relation 27669. Up to 11269 conditions per place. [2023-11-29 04:04:02,397 INFO L140 encePairwiseOnDemand]: 85/88 looper letters, 52 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2023-11-29 04:04:02,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 75 transitions, 268 flow [2023-11-29 04:04:02,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:04:02,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:04:02,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2023-11-29 04:04:02,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2023-11-29 04:04:02,400 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 136 transitions. [2023-11-29 04:04:02,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 136 transitions. [2023-11-29 04:04:02,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:02,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 136 transitions. [2023-11-29 04:04:02,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:02,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:02,403 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:02,403 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 128 flow. Second operand 3 states and 136 transitions. [2023-11-29 04:04:02,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 75 transitions, 268 flow [2023-11-29 04:04:02,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 75 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:04:02,411 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 126 flow [2023-11-29 04:04:02,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, 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-29 04:04:02,412 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -26 predicate places. [2023-11-29 04:04:02,413 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 126 flow [2023-11-29 04:04:02,413 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-29 04:04:02,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:02,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:04:02,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:04:02,414 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:02,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:02,414 INFO L85 PathProgramCache]: Analyzing trace with hash 700804869, now seen corresponding path program 1 times [2023-11-29 04:04:02,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:04:02,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484950751] [2023-11-29 04:04:02,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:02,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:04:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:02,506 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-29 04:04:02,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:04:02,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484950751] [2023-11-29 04:04:02,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484950751] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:02,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:02,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:04:02,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692768095] [2023-11-29 04:04:02,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:02,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:04:02,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:04:02,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:04:02,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:04:02,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2023-11-29 04:04:02,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:02,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:02,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2023-11-29 04:04:02,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:03,808 INFO L124 PetriNetUnfolderBase]: 4498/7558 cut-off events. [2023-11-29 04:04:03,809 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2023-11-29 04:04:03,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14401 conditions, 7558 events. 4498/7558 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 692. Compared 61946 event pairs, 3059 based on Foata normal form. 0/4870 useless extension candidates. Maximal degree in co-relation 14390. Up to 4121 conditions per place. [2023-11-29 04:04:03,847 INFO L140 encePairwiseOnDemand]: 75/88 looper letters, 55 selfloop transitions, 6 changer transitions 0/81 dead transitions. [2023-11-29 04:04:03,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 81 transitions, 294 flow [2023-11-29 04:04:03,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:04:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:04:03,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2023-11-29 04:04:03,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142045454545454 [2023-11-29 04:04:03,849 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 181 transitions. [2023-11-29 04:04:03,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 181 transitions. [2023-11-29 04:04:03,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:03,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 181 transitions. [2023-11-29 04:04:03,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:03,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:03,852 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:03,852 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 126 flow. Second operand 4 states and 181 transitions. [2023-11-29 04:04:03,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 81 transitions, 294 flow [2023-11-29 04:04:03,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 81 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:04:03,855 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 178 flow [2023-11-29 04:04:03,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, 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=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2023-11-29 04:04:03,856 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -24 predicate places. [2023-11-29 04:04:03,856 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 178 flow [2023-11-29 04:04:03,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:03,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:03,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:04:03,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:04:03,857 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:03,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:03,857 INFO L85 PathProgramCache]: Analyzing trace with hash 700804870, now seen corresponding path program 1 times [2023-11-29 04:04:03,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:04:03,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315211845] [2023-11-29 04:04:03,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:03,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:04:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:03,942 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-29 04:04:03,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:04:03,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315211845] [2023-11-29 04:04:03,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315211845] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:03,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:03,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:04:03,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270513874] [2023-11-29 04:04:03,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:03,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:04:03,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:04:03,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:04:03,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:04:03,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 88 [2023-11-29 04:04:03,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 178 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-29 04:04:03,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:03,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 88 [2023-11-29 04:04:03,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:04,366 INFO L124 PetriNetUnfolderBase]: 1304/2461 cut-off events. [2023-11-29 04:04:04,366 INFO L125 PetriNetUnfolderBase]: For 988/988 co-relation queries the response was YES. [2023-11-29 04:04:04,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5931 conditions, 2461 events. 1304/2461 cut-off events. For 988/988 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 18580 event pairs, 1168 based on Foata normal form. 691/3003 useless extension candidates. Maximal degree in co-relation 5917. Up to 2069 conditions per place. [2023-11-29 04:04:04,375 INFO L140 encePairwiseOnDemand]: 80/88 looper letters, 31 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2023-11-29 04:04:04,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 53 transitions, 228 flow [2023-11-29 04:04:04,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:04:04,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:04:04,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-29 04:04:04,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45075757575757575 [2023-11-29 04:04:04,377 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-29 04:04:04,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-29 04:04:04,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:04,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-29 04:04:04,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:04,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:04,379 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:04,379 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 178 flow. Second operand 3 states and 119 transitions. [2023-11-29 04:04:04,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 53 transitions, 228 flow [2023-11-29 04:04:04,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 53 transitions, 226 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:04:04,382 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 164 flow [2023-11-29 04:04:04,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2023-11-29 04:04:04,383 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -30 predicate places. [2023-11-29 04:04:04,383 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 164 flow [2023-11-29 04:04:04,383 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-29 04:04:04,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:04,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:04:04,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 04:04:04,384 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:04,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:04,384 INFO L85 PathProgramCache]: Analyzing trace with hash -160911075, now seen corresponding path program 1 times [2023-11-29 04:04:04,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:04:04,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625051560] [2023-11-29 04:04:04,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:04,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:04:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:04,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-29 04:04:04,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:04:04,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625051560] [2023-11-29 04:04:04,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625051560] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:04,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:04,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:04:04,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293624733] [2023-11-29 04:04:04,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:04,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:04:04,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:04:04,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:04:04,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:04:04,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 88 [2023-11-29 04:04:04,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:04,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:04,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 88 [2023-11-29 04:04:04,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:04,784 INFO L124 PetriNetUnfolderBase]: 1316/2449 cut-off events. [2023-11-29 04:04:04,784 INFO L125 PetriNetUnfolderBase]: For 963/963 co-relation queries the response was YES. [2023-11-29 04:04:04,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5947 conditions, 2449 events. 1316/2449 cut-off events. For 963/963 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 18227 event pairs, 878 based on Foata normal form. 0/2314 useless extension candidates. Maximal degree in co-relation 5937. Up to 1077 conditions per place. [2023-11-29 04:04:04,793 INFO L140 encePairwiseOnDemand]: 85/88 looper letters, 38 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-29 04:04:04,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 59 transitions, 264 flow [2023-11-29 04:04:04,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:04:04,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:04:04,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2023-11-29 04:04:04,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4356060606060606 [2023-11-29 04:04:04,795 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 115 transitions. [2023-11-29 04:04:04,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 115 transitions. [2023-11-29 04:04:04,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:04,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 115 transitions. [2023-11-29 04:04:04,796 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-29 04:04:04,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:04,797 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:04,797 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 164 flow. Second operand 3 states and 115 transitions. [2023-11-29 04:04:04,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 59 transitions, 264 flow [2023-11-29 04:04:04,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 59 transitions, 263 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:04:04,800 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 165 flow [2023-11-29 04:04:04,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-11-29 04:04:04,801 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -30 predicate places. [2023-11-29 04:04:04,801 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 165 flow [2023-11-29 04:04:04,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:04,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:04,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:04:04,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 04:04:04,802 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:04,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:04,802 INFO L85 PathProgramCache]: Analyzing trace with hash -160911074, now seen corresponding path program 1 times [2023-11-29 04:04:04,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:04:04,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887610418] [2023-11-29 04:04:04,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:04,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:04:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:04,871 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-29 04:04:04,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:04:04,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887610418] [2023-11-29 04:04:04,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887610418] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:04,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:04,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:04:04,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537237832] [2023-11-29 04:04:04,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:04,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:04:04,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:04:04,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:04:04,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:04:04,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2023-11-29 04:04:04,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 165 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-29 04:04:04,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:04,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2023-11-29 04:04:04,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:05,247 INFO L124 PetriNetUnfolderBase]: 1304/2428 cut-off events. [2023-11-29 04:04:05,247 INFO L125 PetriNetUnfolderBase]: For 1035/1035 co-relation queries the response was YES. [2023-11-29 04:04:05,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5944 conditions, 2428 events. 1304/2428 cut-off events. For 1035/1035 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 18091 event pairs, 872 based on Foata normal form. 9/2305 useless extension candidates. Maximal degree in co-relation 5934. Up to 1077 conditions per place. [2023-11-29 04:04:05,257 INFO L140 encePairwiseOnDemand]: 85/88 looper letters, 37 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-11-29 04:04:05,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 58 transitions, 263 flow [2023-11-29 04:04:05,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:04:05,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:04:05,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-29 04:04:05,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4431818181818182 [2023-11-29 04:04:05,258 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-29 04:04:05,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-29 04:04:05,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:05,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-29 04:04:05,259 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-29 04:04:05,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:05,260 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:05,260 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 165 flow. Second operand 3 states and 117 transitions. [2023-11-29 04:04:05,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 58 transitions, 263 flow [2023-11-29 04:04:05,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 58 transitions, 259 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:04:05,262 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 163 flow [2023-11-29 04:04:05,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=159, 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=3, PETRI_FLOW=163, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-11-29 04:04:05,263 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -31 predicate places. [2023-11-29 04:04:05,263 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 163 flow [2023-11-29 04:04:05,263 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-29 04:04:05,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:05,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:04:05,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 04:04:05,263 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:05,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:05,264 INFO L85 PathProgramCache]: Analyzing trace with hash 389339820, now seen corresponding path program 1 times [2023-11-29 04:04:05,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:04:05,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596429209] [2023-11-29 04:04:05,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:05,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:04:05,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:05,339 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-29 04:04:05,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:04:05,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596429209] [2023-11-29 04:04:05,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596429209] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:05,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:05,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:04:05,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808046273] [2023-11-29 04:04:05,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:05,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:04:05,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:04:05,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:04:05,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:04:05,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 88 [2023-11-29 04:04:05,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 163 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:05,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:05,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 88 [2023-11-29 04:04:05,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:05,748 INFO L124 PetriNetUnfolderBase]: 1246/2580 cut-off events. [2023-11-29 04:04:05,748 INFO L125 PetriNetUnfolderBase]: For 882/890 co-relation queries the response was YES. [2023-11-29 04:04:05,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5970 conditions, 2580 events. 1246/2580 cut-off events. For 882/890 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 20590 event pairs, 432 based on Foata normal form. 0/2454 useless extension candidates. Maximal degree in co-relation 5960. Up to 1359 conditions per place. [2023-11-29 04:04:05,760 INFO L140 encePairwiseOnDemand]: 84/88 looper letters, 53 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2023-11-29 04:04:05,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 75 transitions, 368 flow [2023-11-29 04:04:05,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:04:05,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:04:05,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2023-11-29 04:04:05,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2023-11-29 04:04:05,762 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 135 transitions. [2023-11-29 04:04:05,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 135 transitions. [2023-11-29 04:04:05,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:05,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 135 transitions. [2023-11-29 04:04:05,763 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-29 04:04:05,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:05,764 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:05,764 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 163 flow. Second operand 3 states and 135 transitions. [2023-11-29 04:04:05,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 75 transitions, 368 flow [2023-11-29 04:04:05,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 75 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:04:05,767 INFO L231 Difference]: Finished difference. Result has 63 places, 51 transitions, 172 flow [2023-11-29 04:04:05,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=63, PETRI_TRANSITIONS=51} [2023-11-29 04:04:05,768 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -30 predicate places. [2023-11-29 04:04:05,768 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 51 transitions, 172 flow [2023-11-29 04:04:05,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:05,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:05,769 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:04:05,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 04:04:05,769 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:05,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:05,770 INFO L85 PathProgramCache]: Analyzing trace with hash 493491838, now seen corresponding path program 1 times [2023-11-29 04:04:05,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:04:05,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358820035] [2023-11-29 04:04:05,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:05,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:04:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:05,875 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-29 04:04:05,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:04:05,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358820035] [2023-11-29 04:04:05,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358820035] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:05,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:05,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:04:05,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122525118] [2023-11-29 04:04:05,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:05,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:04:05,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:04:05,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:04:05,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:04:05,896 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 88 [2023-11-29 04:04:05,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:05,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:05,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 88 [2023-11-29 04:04:05,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:06,420 INFO L124 PetriNetUnfolderBase]: 1280/2642 cut-off events. [2023-11-29 04:04:06,420 INFO L125 PetriNetUnfolderBase]: For 1177/1185 co-relation queries the response was YES. [2023-11-29 04:04:06,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6495 conditions, 2642 events. 1280/2642 cut-off events. For 1177/1185 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 20883 event pairs, 372 based on Foata normal form. 0/2588 useless extension candidates. Maximal degree in co-relation 6483. Up to 972 conditions per place. [2023-11-29 04:04:06,429 INFO L140 encePairwiseOnDemand]: 81/88 looper letters, 45 selfloop transitions, 8 changer transitions 0/72 dead transitions. [2023-11-29 04:04:06,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 331 flow [2023-11-29 04:04:06,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:04:06,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:04:06,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2023-11-29 04:04:06,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4715909090909091 [2023-11-29 04:04:06,431 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 166 transitions. [2023-11-29 04:04:06,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 166 transitions. [2023-11-29 04:04:06,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:06,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 166 transitions. [2023-11-29 04:04:06,432 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-29 04:04:06,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:06,433 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:06,433 INFO L175 Difference]: Start difference. First operand has 63 places, 51 transitions, 172 flow. Second operand 4 states and 166 transitions. [2023-11-29 04:04:06,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 331 flow [2023-11-29 04:04:06,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 72 transitions, 325 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:04:06,436 INFO L231 Difference]: Finished difference. Result has 63 places, 51 transitions, 183 flow [2023-11-29 04:04:06,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=63, PETRI_TRANSITIONS=51} [2023-11-29 04:04:06,437 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -30 predicate places. [2023-11-29 04:04:06,437 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 51 transitions, 183 flow [2023-11-29 04:04:06,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:06,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:06,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:04:06,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 04:04:06,438 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:06,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:06,438 INFO L85 PathProgramCache]: Analyzing trace with hash -739751291, now seen corresponding path program 1 times [2023-11-29 04:04:06,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:04:06,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66947262] [2023-11-29 04:04:06,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:06,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:04:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:06,605 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-29 04:04:06,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:04:06,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66947262] [2023-11-29 04:04:06,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66947262] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:06,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:06,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:04:06,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531053634] [2023-11-29 04:04:06,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:06,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:04:06,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:04:06,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:04:06,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:04:06,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 88 [2023-11-29 04:04:06,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 183 flow. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 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-29 04:04:06,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:06,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 88 [2023-11-29 04:04:06,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:07,052 INFO L124 PetriNetUnfolderBase]: 1234/2576 cut-off events. [2023-11-29 04:04:07,052 INFO L125 PetriNetUnfolderBase]: For 1381/1389 co-relation queries the response was YES. [2023-11-29 04:04:07,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6471 conditions, 2576 events. 1234/2576 cut-off events. For 1381/1389 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 20430 event pairs, 612 based on Foata normal form. 24/2554 useless extension candidates. Maximal degree in co-relation 6459. Up to 1378 conditions per place. [2023-11-29 04:04:07,061 INFO L140 encePairwiseOnDemand]: 85/88 looper letters, 51 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2023-11-29 04:04:07,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 73 transitions, 377 flow [2023-11-29 04:04:07,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:04:07,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:04:07,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2023-11-29 04:04:07,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2023-11-29 04:04:07,062 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 160 transitions. [2023-11-29 04:04:07,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 160 transitions. [2023-11-29 04:04:07,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:07,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 160 transitions. [2023-11-29 04:04:07,063 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-29 04:04:07,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:07,064 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:07,064 INFO L175 Difference]: Start difference. First operand has 63 places, 51 transitions, 183 flow. Second operand 4 states and 160 transitions. [2023-11-29 04:04:07,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 73 transitions, 377 flow [2023-11-29 04:04:07,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 73 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:04:07,066 INFO L231 Difference]: Finished difference. Result has 63 places, 50 transitions, 175 flow [2023-11-29 04:04:07,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=63, PETRI_TRANSITIONS=50} [2023-11-29 04:04:07,067 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -30 predicate places. [2023-11-29 04:04:07,067 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 50 transitions, 175 flow [2023-11-29 04:04:07,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 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-29 04:04:07,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:07,067 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-29 04:04:07,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 04:04:07,067 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:07,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:07,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1744992147, now seen corresponding path program 1 times [2023-11-29 04:04:07,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:04:07,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481216689] [2023-11-29 04:04:07,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:07,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:04:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:07,581 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-29 04:04:07,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:04:07,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481216689] [2023-11-29 04:04:07,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481216689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:07,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:07,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:04:07,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237465792] [2023-11-29 04:04:07,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:07,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:04:07,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:04:07,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:04:07,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:04:07,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2023-11-29 04:04:07,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 50 transitions, 175 flow. Second operand has 8 states, 8 states have (on average 25.75) internal successors, (206), 8 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:07,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:07,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2023-11-29 04:04:07,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:08,241 INFO L124 PetriNetUnfolderBase]: 1921/3824 cut-off events. [2023-11-29 04:04:08,242 INFO L125 PetriNetUnfolderBase]: For 1926/1936 co-relation queries the response was YES. [2023-11-29 04:04:08,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9312 conditions, 3824 events. 1921/3824 cut-off events. For 1926/1936 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 32087 event pairs, 641 based on Foata normal form. 0/3666 useless extension candidates. Maximal degree in co-relation 9300. Up to 1308 conditions per place. [2023-11-29 04:04:08,255 INFO L140 encePairwiseOnDemand]: 81/88 looper letters, 73 selfloop transitions, 9 changer transitions 0/99 dead transitions. [2023-11-29 04:04:08,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 99 transitions, 516 flow [2023-11-29 04:04:08,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:04:08,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:04:08,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 244 transitions. [2023-11-29 04:04:08,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3961038961038961 [2023-11-29 04:04:08,257 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 244 transitions. [2023-11-29 04:04:08,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 244 transitions. [2023-11-29 04:04:08,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:08,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 244 transitions. [2023-11-29 04:04:08,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 34.857142857142854) internal successors, (244), 7 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:08,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 88.0) internal successors, (704), 8 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:08,259 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 88.0) internal successors, (704), 8 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:08,259 INFO L175 Difference]: Start difference. First operand has 63 places, 50 transitions, 175 flow. Second operand 7 states and 244 transitions. [2023-11-29 04:04:08,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 99 transitions, 516 flow [2023-11-29 04:04:08,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 99 transitions, 509 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:04:08,262 INFO L231 Difference]: Finished difference. Result has 72 places, 57 transitions, 249 flow [2023-11-29 04:04:08,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=249, PETRI_PLACES=72, PETRI_TRANSITIONS=57} [2023-11-29 04:04:08,262 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -21 predicate places. [2023-11-29 04:04:08,263 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 57 transitions, 249 flow [2023-11-29 04:04:08,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.75) internal successors, (206), 8 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:08,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:08,263 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-29 04:04:08,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 04:04:08,263 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:08,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:08,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1744990709, now seen corresponding path program 1 times [2023-11-29 04:04:08,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:04:08,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489162792] [2023-11-29 04:04:08,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:08,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:04:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:08,458 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-29 04:04:08,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:04:08,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489162792] [2023-11-29 04:04:08,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489162792] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:08,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:08,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:04:08,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708702573] [2023-11-29 04:04:08,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:08,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:04:08,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:04:08,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:04:08,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:04:08,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 88 [2023-11-29 04:04:08,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 57 transitions, 249 flow. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:08,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:08,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 88 [2023-11-29 04:04:08,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:09,444 INFO L124 PetriNetUnfolderBase]: 3669/6790 cut-off events. [2023-11-29 04:04:09,445 INFO L125 PetriNetUnfolderBase]: For 5695/5861 co-relation queries the response was YES. [2023-11-29 04:04:09,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18703 conditions, 6790 events. 3669/6790 cut-off events. For 5695/5861 co-relation queries the response was YES. Maximal size of possible extension queue 681. Compared 58669 event pairs, 788 based on Foata normal form. 0/6585 useless extension candidates. Maximal degree in co-relation 18686. Up to 2861 conditions per place. [2023-11-29 04:04:09,474 INFO L140 encePairwiseOnDemand]: 81/88 looper letters, 100 selfloop transitions, 17 changer transitions 1/135 dead transitions. [2023-11-29 04:04:09,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 135 transitions, 876 flow [2023-11-29 04:04:09,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:04:09,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 04:04:09,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 299 transitions. [2023-11-29 04:04:09,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4247159090909091 [2023-11-29 04:04:09,477 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 299 transitions. [2023-11-29 04:04:09,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 299 transitions. [2023-11-29 04:04:09,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:09,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 299 transitions. [2023-11-29 04:04:09,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 37.375) internal successors, (299), 8 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:09,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 88.0) internal successors, (792), 9 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:09,480 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 88.0) internal successors, (792), 9 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:09,480 INFO L175 Difference]: Start difference. First operand has 72 places, 57 transitions, 249 flow. Second operand 8 states and 299 transitions. [2023-11-29 04:04:09,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 135 transitions, 876 flow [2023-11-29 04:04:09,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 135 transitions, 874 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-29 04:04:09,501 INFO L231 Difference]: Finished difference. Result has 83 places, 69 transitions, 376 flow [2023-11-29 04:04:09,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=376, PETRI_PLACES=83, PETRI_TRANSITIONS=69} [2023-11-29 04:04:09,502 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -10 predicate places. [2023-11-29 04:04:09,502 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 69 transitions, 376 flow [2023-11-29 04:04:09,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:09,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:09,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:04:09,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 04:04:09,502 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:09,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:09,503 INFO L85 PathProgramCache]: Analyzing trace with hash -517017946, now seen corresponding path program 1 times [2023-11-29 04:04:09,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:04:09,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548912892] [2023-11-29 04:04:09,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:09,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:04:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:09,808 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-29 04:04:09,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:04:09,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548912892] [2023-11-29 04:04:09,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548912892] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:09,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:09,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:04:09,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685292343] [2023-11-29 04:04:09,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:09,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:04:09,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:04:09,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:04:09,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:04:09,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2023-11-29 04:04:09,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 69 transitions, 376 flow. Second operand has 7 states, 7 states have (on average 28.857142857142858) internal successors, (202), 7 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:09,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:09,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2023-11-29 04:04:09,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:10,451 INFO L124 PetriNetUnfolderBase]: 1952/3680 cut-off events. [2023-11-29 04:04:10,451 INFO L125 PetriNetUnfolderBase]: For 4835/4978 co-relation queries the response was YES. [2023-11-29 04:04:10,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10506 conditions, 3680 events. 1952/3680 cut-off events. For 4835/4978 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 29502 event pairs, 1043 based on Foata normal form. 198/3766 useless extension candidates. Maximal degree in co-relation 10483. Up to 1619 conditions per place. [2023-11-29 04:04:10,465 INFO L140 encePairwiseOnDemand]: 79/88 looper letters, 34 selfloop transitions, 8 changer transitions 10/74 dead transitions. [2023-11-29 04:04:10,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 74 transitions, 478 flow [2023-11-29 04:04:10,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:04:10,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:04:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 201 transitions. [2023-11-29 04:04:10,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2023-11-29 04:04:10,466 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 201 transitions. [2023-11-29 04:04:10,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 201 transitions. [2023-11-29 04:04:10,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:10,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 201 transitions. [2023-11-29 04:04:10,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:10,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:10,468 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:10,468 INFO L175 Difference]: Start difference. First operand has 83 places, 69 transitions, 376 flow. Second operand 6 states and 201 transitions. [2023-11-29 04:04:10,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 74 transitions, 478 flow [2023-11-29 04:04:10,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 74 transitions, 464 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:04:10,488 INFO L231 Difference]: Finished difference. Result has 81 places, 54 transitions, 253 flow [2023-11-29 04:04:10,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=253, PETRI_PLACES=81, PETRI_TRANSITIONS=54} [2023-11-29 04:04:10,489 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -12 predicate places. [2023-11-29 04:04:10,489 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 54 transitions, 253 flow [2023-11-29 04:04:10,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.857142857142858) internal successors, (202), 7 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:10,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:10,489 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:04:10,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 04:04:10,490 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:10,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:10,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1122301910, now seen corresponding path program 1 times [2023-11-29 04:04:10,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:04:10,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156230133] [2023-11-29 04:04:10,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:10,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:04:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:11,646 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-29 04:04:11,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:04:11,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156230133] [2023-11-29 04:04:11,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156230133] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:11,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:11,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:04:11,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453108700] [2023-11-29 04:04:11,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:11,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:04:11,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:04:11,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:04:11,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:04:11,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2023-11-29 04:04:11,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 54 transitions, 253 flow. Second operand has 10 states, 10 states have (on average 25.5) internal successors, (255), 10 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:11,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:11,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2023-11-29 04:04:11,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:12,621 INFO L124 PetriNetUnfolderBase]: 1847/3626 cut-off events. [2023-11-29 04:04:12,621 INFO L125 PetriNetUnfolderBase]: For 3669/3691 co-relation queries the response was YES. [2023-11-29 04:04:12,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9489 conditions, 3626 events. 1847/3626 cut-off events. For 3669/3691 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 30410 event pairs, 1326 based on Foata normal form. 94/3647 useless extension candidates. Maximal degree in co-relation 9466. Up to 1653 conditions per place. [2023-11-29 04:04:12,637 INFO L140 encePairwiseOnDemand]: 80/88 looper letters, 51 selfloop transitions, 11 changer transitions 24/103 dead transitions. [2023-11-29 04:04:12,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 103 transitions, 644 flow [2023-11-29 04:04:12,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:04:12,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 04:04:12,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 257 transitions. [2023-11-29 04:04:12,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3650568181818182 [2023-11-29 04:04:12,639 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 257 transitions. [2023-11-29 04:04:12,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 257 transitions. [2023-11-29 04:04:12,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:12,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 257 transitions. [2023-11-29 04:04:12,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 32.125) internal successors, (257), 8 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:12,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 88.0) internal successors, (792), 9 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:12,642 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 88.0) internal successors, (792), 9 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:12,642 INFO L175 Difference]: Start difference. First operand has 81 places, 54 transitions, 253 flow. Second operand 8 states and 257 transitions. [2023-11-29 04:04:12,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 103 transitions, 644 flow [2023-11-29 04:04:12,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 103 transitions, 600 flow, removed 1 selfloop flow, removed 8 redundant places. [2023-11-29 04:04:12,652 INFO L231 Difference]: Finished difference. Result has 82 places, 53 transitions, 257 flow [2023-11-29 04:04:12,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=257, PETRI_PLACES=82, PETRI_TRANSITIONS=53} [2023-11-29 04:04:12,653 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -11 predicate places. [2023-11-29 04:04:12,653 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 53 transitions, 257 flow [2023-11-29 04:04:12,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 25.5) internal successors, (255), 10 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:12,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:12,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:04:12,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 04:04:12,654 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:12,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:12,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1688033854, now seen corresponding path program 1 times [2023-11-29 04:04:12,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:04:12,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342010137] [2023-11-29 04:04:12,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:12,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:04:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:12,882 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-29 04:04:12,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:04:12,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342010137] [2023-11-29 04:04:12,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342010137] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:12,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:12,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:04:12,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766441226] [2023-11-29 04:04:12,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:12,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:04:12,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:04:12,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:04:12,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:04:12,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2023-11-29 04:04:12,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 53 transitions, 257 flow. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:12,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:12,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2023-11-29 04:04:12,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:13,533 INFO L124 PetriNetUnfolderBase]: 1723/3349 cut-off events. [2023-11-29 04:04:13,534 INFO L125 PetriNetUnfolderBase]: For 2764/2819 co-relation queries the response was YES. [2023-11-29 04:04:13,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8780 conditions, 3349 events. 1723/3349 cut-off events. For 2764/2819 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 26932 event pairs, 651 based on Foata normal form. 64/3340 useless extension candidates. Maximal degree in co-relation 8757. Up to 1792 conditions per place. [2023-11-29 04:04:13,550 INFO L140 encePairwiseOnDemand]: 81/88 looper letters, 44 selfloop transitions, 7 changer transitions 32/101 dead transitions. [2023-11-29 04:04:13,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 101 transitions, 626 flow [2023-11-29 04:04:13,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:04:13,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 04:04:13,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 286 transitions. [2023-11-29 04:04:13,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2023-11-29 04:04:13,552 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 286 transitions. [2023-11-29 04:04:13,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 286 transitions. [2023-11-29 04:04:13,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:13,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 286 transitions. [2023-11-29 04:04:13,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 35.75) internal successors, (286), 8 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:13,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 88.0) internal successors, (792), 9 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:13,555 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 88.0) internal successors, (792), 9 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:13,555 INFO L175 Difference]: Start difference. First operand has 82 places, 53 transitions, 257 flow. Second operand 8 states and 286 transitions. [2023-11-29 04:04:13,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 101 transitions, 626 flow [2023-11-29 04:04:13,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 101 transitions, 575 flow, removed 15 selfloop flow, removed 8 redundant places. [2023-11-29 04:04:13,566 INFO L231 Difference]: Finished difference. Result has 81 places, 53 transitions, 251 flow [2023-11-29 04:04:13,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=251, PETRI_PLACES=81, PETRI_TRANSITIONS=53} [2023-11-29 04:04:13,567 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -12 predicate places. [2023-11-29 04:04:13,567 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 53 transitions, 251 flow [2023-11-29 04:04:13,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:13,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:13,567 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-29 04:04:13,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 04:04:13,568 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:13,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:13,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1208349515, now seen corresponding path program 1 times [2023-11-29 04:04:13,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:04:13,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713235772] [2023-11-29 04:04:13,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:13,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:04:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:14,124 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-29 04:04:14,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:04:14,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713235772] [2023-11-29 04:04:14,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713235772] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:14,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:14,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:04:14,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417730811] [2023-11-29 04:04:14,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:14,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:04:14,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:04:14,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:04:14,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:04:14,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2023-11-29 04:04:14,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 53 transitions, 251 flow. Second operand has 8 states, 8 states have (on average 28.625) internal successors, (229), 8 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:14,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:14,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2023-11-29 04:04:14,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:14,807 INFO L124 PetriNetUnfolderBase]: 1635/3081 cut-off events. [2023-11-29 04:04:14,807 INFO L125 PetriNetUnfolderBase]: For 2912/2940 co-relation queries the response was YES. [2023-11-29 04:04:14,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8267 conditions, 3081 events. 1635/3081 cut-off events. For 2912/2940 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 23958 event pairs, 207 based on Foata normal form. 86/3153 useless extension candidates. Maximal degree in co-relation 8244. Up to 1436 conditions per place. [2023-11-29 04:04:14,820 INFO L140 encePairwiseOnDemand]: 80/88 looper letters, 59 selfloop transitions, 18 changer transitions 9/104 dead transitions. [2023-11-29 04:04:14,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 104 transitions, 647 flow [2023-11-29 04:04:14,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:04:14,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 04:04:14,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 313 transitions. [2023-11-29 04:04:14,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3952020202020202 [2023-11-29 04:04:14,822 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 313 transitions. [2023-11-29 04:04:14,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 313 transitions. [2023-11-29 04:04:14,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:14,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 313 transitions. [2023-11-29 04:04:14,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 34.77777777777778) internal successors, (313), 9 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:14,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 88.0) internal successors, (880), 10 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:14,824 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 88.0) internal successors, (880), 10 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:14,825 INFO L175 Difference]: Start difference. First operand has 81 places, 53 transitions, 251 flow. Second operand 9 states and 313 transitions. [2023-11-29 04:04:14,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 104 transitions, 647 flow [2023-11-29 04:04:14,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 104 transitions, 597 flow, removed 9 selfloop flow, removed 8 redundant places. [2023-11-29 04:04:14,835 INFO L231 Difference]: Finished difference. Result has 82 places, 63 transitions, 356 flow [2023-11-29 04:04:14,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=356, PETRI_PLACES=82, PETRI_TRANSITIONS=63} [2023-11-29 04:04:14,835 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -11 predicate places. [2023-11-29 04:04:14,835 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 63 transitions, 356 flow [2023-11-29 04:04:14,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 28.625) internal successors, (229), 8 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:14,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:14,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:04:14,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 04:04:14,836 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:14,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:14,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1213705656, now seen corresponding path program 1 times [2023-11-29 04:04:14,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:04:14,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866441891] [2023-11-29 04:04:14,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:14,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:04:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:15,144 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-29 04:04:15,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:04:15,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866441891] [2023-11-29 04:04:15,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866441891] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:15,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:15,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:04:15,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654844424] [2023-11-29 04:04:15,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:15,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:04:15,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:04:15,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:04:15,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:04:15,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2023-11-29 04:04:15,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 63 transitions, 356 flow. Second operand has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 7 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:15,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:15,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2023-11-29 04:04:15,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:15,718 INFO L124 PetriNetUnfolderBase]: 1375/2664 cut-off events. [2023-11-29 04:04:15,718 INFO L125 PetriNetUnfolderBase]: For 3524/3542 co-relation queries the response was YES. [2023-11-29 04:04:15,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7507 conditions, 2664 events. 1375/2664 cut-off events. For 3524/3542 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 20585 event pairs, 958 based on Foata normal form. 62/2668 useless extension candidates. Maximal degree in co-relation 7483. Up to 2081 conditions per place. [2023-11-29 04:04:15,729 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 29 selfloop transitions, 8 changer transitions 15/69 dead transitions. [2023-11-29 04:04:15,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 69 transitions, 472 flow [2023-11-29 04:04:15,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:04:15,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:04:15,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 177 transitions. [2023-11-29 04:04:15,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3352272727272727 [2023-11-29 04:04:15,731 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 177 transitions. [2023-11-29 04:04:15,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 177 transitions. [2023-11-29 04:04:15,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:15,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 177 transitions. [2023-11-29 04:04:15,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 29.5) internal successors, (177), 6 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:15,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:15,733 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:15,733 INFO L175 Difference]: Start difference. First operand has 82 places, 63 transitions, 356 flow. Second operand 6 states and 177 transitions. [2023-11-29 04:04:15,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 69 transitions, 472 flow [2023-11-29 04:04:15,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 69 transitions, 464 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-11-29 04:04:15,745 INFO L231 Difference]: Finished difference. Result has 86 places, 51 transitions, 273 flow [2023-11-29 04:04:15,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=273, PETRI_PLACES=86, PETRI_TRANSITIONS=51} [2023-11-29 04:04:15,745 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -7 predicate places. [2023-11-29 04:04:15,745 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 51 transitions, 273 flow [2023-11-29 04:04:15,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 7 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:15,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:15,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:04:15,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 04:04:15,746 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:15,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:15,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1965956560, now seen corresponding path program 1 times [2023-11-29 04:04:15,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:04:15,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502573113] [2023-11-29 04:04:15,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:15,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:04:15,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:15,900 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-29 04:04:15,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:04:15,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502573113] [2023-11-29 04:04:15,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502573113] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:15,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:15,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:04:15,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523562421] [2023-11-29 04:04:15,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:15,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:04:15,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:04:15,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:04:15,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:04:15,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2023-11-29 04:04:15,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 51 transitions, 273 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:15,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:15,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2023-11-29 04:04:15,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:16,738 INFO L124 PetriNetUnfolderBase]: 3683/6150 cut-off events. [2023-11-29 04:04:16,738 INFO L125 PetriNetUnfolderBase]: For 6649/6672 co-relation queries the response was YES. [2023-11-29 04:04:16,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16301 conditions, 6150 events. 3683/6150 cut-off events. For 6649/6672 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 42995 event pairs, 369 based on Foata normal form. 249/6384 useless extension candidates. Maximal degree in co-relation 16275. Up to 3505 conditions per place. [2023-11-29 04:04:16,761 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 68 selfloop transitions, 5 changer transitions 1/88 dead transitions. [2023-11-29 04:04:16,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 88 transitions, 650 flow [2023-11-29 04:04:16,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:04:16,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:04:16,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2023-11-29 04:04:16,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2023-11-29 04:04:16,763 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 144 transitions. [2023-11-29 04:04:16,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 144 transitions. [2023-11-29 04:04:16,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:16,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 144 transitions. [2023-11-29 04:04:16,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:16,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:16,764 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:16,764 INFO L175 Difference]: Start difference. First operand has 86 places, 51 transitions, 273 flow. Second operand 4 states and 144 transitions. [2023-11-29 04:04:16,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 88 transitions, 650 flow [2023-11-29 04:04:16,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 88 transitions, 589 flow, removed 3 selfloop flow, removed 10 redundant places. [2023-11-29 04:04:16,786 INFO L231 Difference]: Finished difference. Result has 73 places, 54 transitions, 273 flow [2023-11-29 04:04:16,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=273, PETRI_PLACES=73, PETRI_TRANSITIONS=54} [2023-11-29 04:04:16,787 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -20 predicate places. [2023-11-29 04:04:16,787 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 54 transitions, 273 flow [2023-11-29 04:04:16,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:16,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:16,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:04:16,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 04:04:16,788 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:16,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:16,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1597505623, now seen corresponding path program 1 times [2023-11-29 04:04:16,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:04:16,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495477386] [2023-11-29 04:04:16,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:16,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:04:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:16,918 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-29 04:04:16,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:04:16,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495477386] [2023-11-29 04:04:16,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495477386] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:16,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:16,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:04:16,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522025399] [2023-11-29 04:04:16,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:16,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:04:16,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:04:16,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:04:16,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:04:16,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2023-11-29 04:04:16,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 54 transitions, 273 flow. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:16,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:16,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2023-11-29 04:04:16,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:17,497 INFO L124 PetriNetUnfolderBase]: 2611/4464 cut-off events. [2023-11-29 04:04:17,497 INFO L125 PetriNetUnfolderBase]: For 4244/4275 co-relation queries the response was YES. [2023-11-29 04:04:17,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12690 conditions, 4464 events. 2611/4464 cut-off events. For 4244/4275 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 29326 event pairs, 136 based on Foata normal form. 222/4672 useless extension candidates. Maximal degree in co-relation 12669. Up to 1993 conditions per place. [2023-11-29 04:04:17,515 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 74 selfloop transitions, 8 changer transitions 1/97 dead transitions. [2023-11-29 04:04:17,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 97 transitions, 673 flow [2023-11-29 04:04:17,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:04:17,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:04:17,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions. [2023-11-29 04:04:17,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4113636363636364 [2023-11-29 04:04:17,517 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 181 transitions. [2023-11-29 04:04:17,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 181 transitions. [2023-11-29 04:04:17,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:17,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 181 transitions. [2023-11-29 04:04:17,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:17,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 88.0) internal successors, (528), 6 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:17,519 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 88.0) internal successors, (528), 6 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:17,519 INFO L175 Difference]: Start difference. First operand has 73 places, 54 transitions, 273 flow. Second operand 5 states and 181 transitions. [2023-11-29 04:04:17,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 97 transitions, 673 flow [2023-11-29 04:04:17,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 97 transitions, 663 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 04:04:17,526 INFO L231 Difference]: Finished difference. Result has 77 places, 57 transitions, 313 flow [2023-11-29 04:04:17,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=313, PETRI_PLACES=77, PETRI_TRANSITIONS=57} [2023-11-29 04:04:17,526 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -16 predicate places. [2023-11-29 04:04:17,526 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 57 transitions, 313 flow [2023-11-29 04:04:17,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:17,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:17,527 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] [2023-11-29 04:04:17,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 04:04:17,527 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:17,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:17,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1961627924, now seen corresponding path program 1 times [2023-11-29 04:04:17,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:04:17,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727697881] [2023-11-29 04:04:17,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:17,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:04:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:17,682 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-29 04:04:17,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:04:17,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727697881] [2023-11-29 04:04:17,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727697881] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:17,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:17,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:04:17,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182168316] [2023-11-29 04:04:17,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:17,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:04:17,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:04:17,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:04:17,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:04:17,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 88 [2023-11-29 04:04:17,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 57 transitions, 313 flow. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:17,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:17,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 88 [2023-11-29 04:04:17,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:18,542 INFO L124 PetriNetUnfolderBase]: 3238/6156 cut-off events. [2023-11-29 04:04:18,542 INFO L125 PetriNetUnfolderBase]: For 5194/5369 co-relation queries the response was YES. [2023-11-29 04:04:18,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16363 conditions, 6156 events. 3238/6156 cut-off events. For 5194/5369 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 46900 event pairs, 889 based on Foata normal form. 50/5872 useless extension candidates. Maximal degree in co-relation 16340. Up to 2091 conditions per place. [2023-11-29 04:04:18,568 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 71 selfloop transitions, 3 changer transitions 21/116 dead transitions. [2023-11-29 04:04:18,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 116 transitions, 766 flow [2023-11-29 04:04:18,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:04:18,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 04:04:18,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 270 transitions. [2023-11-29 04:04:18,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835227272727273 [2023-11-29 04:04:18,570 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 270 transitions. [2023-11-29 04:04:18,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 270 transitions. [2023-11-29 04:04:18,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:18,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 270 transitions. [2023-11-29 04:04:18,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 33.75) internal successors, (270), 8 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:18,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 88.0) internal successors, (792), 9 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:18,572 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 88.0) internal successors, (792), 9 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:18,573 INFO L175 Difference]: Start difference. First operand has 77 places, 57 transitions, 313 flow. Second operand 8 states and 270 transitions. [2023-11-29 04:04:18,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 116 transitions, 766 flow [2023-11-29 04:04:18,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 116 transitions, 740 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-11-29 04:04:18,583 INFO L231 Difference]: Finished difference. Result has 85 places, 58 transitions, 314 flow [2023-11-29 04:04:18,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=314, PETRI_PLACES=85, PETRI_TRANSITIONS=58} [2023-11-29 04:04:18,583 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -8 predicate places. [2023-11-29 04:04:18,584 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 58 transitions, 314 flow [2023-11-29 04:04:18,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:18,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:18,584 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] [2023-11-29 04:04:18,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 04:04:18,584 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:18,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:18,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1561471304, now seen corresponding path program 2 times [2023-11-29 04:04:18,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:04:18,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400893439] [2023-11-29 04:04:18,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:18,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:04:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:18,765 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-29 04:04:18,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:04:18,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400893439] [2023-11-29 04:04:18,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400893439] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:18,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:18,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:04:18,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130550160] [2023-11-29 04:04:18,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:18,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:04:18,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:04:18,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:04:18,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:04:18,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2023-11-29 04:04:18,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 58 transitions, 314 flow. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:18,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:18,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2023-11-29 04:04:18,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:19,280 INFO L124 PetriNetUnfolderBase]: 2327/3865 cut-off events. [2023-11-29 04:04:19,280 INFO L125 PetriNetUnfolderBase]: For 4350/4406 co-relation queries the response was YES. [2023-11-29 04:04:19,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11496 conditions, 3865 events. 2327/3865 cut-off events. For 4350/4406 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 23701 event pairs, 136 based on Foata normal form. 223/4026 useless extension candidates. Maximal degree in co-relation 11470. Up to 1496 conditions per place. [2023-11-29 04:04:19,318 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 61 selfloop transitions, 11 changer transitions 8/95 dead transitions. [2023-11-29 04:04:19,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 95 transitions, 662 flow [2023-11-29 04:04:19,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:04:19,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:04:19,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 202 transitions. [2023-11-29 04:04:19,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38257575757575757 [2023-11-29 04:04:19,319 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 202 transitions. [2023-11-29 04:04:19,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 202 transitions. [2023-11-29 04:04:19,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:19,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 202 transitions. [2023-11-29 04:04:19,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 33.666666666666664) internal successors, (202), 6 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:19,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:19,321 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:19,321 INFO L175 Difference]: Start difference. First operand has 85 places, 58 transitions, 314 flow. Second operand 6 states and 202 transitions. [2023-11-29 04:04:19,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 95 transitions, 662 flow [2023-11-29 04:04:19,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 95 transitions, 625 flow, removed 6 selfloop flow, removed 7 redundant places. [2023-11-29 04:04:19,325 INFO L231 Difference]: Finished difference. Result has 82 places, 56 transitions, 304 flow [2023-11-29 04:04:19,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=304, PETRI_PLACES=82, PETRI_TRANSITIONS=56} [2023-11-29 04:04:19,325 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -11 predicate places. [2023-11-29 04:04:19,326 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 56 transitions, 304 flow [2023-11-29 04:04:19,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:19,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:19,326 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-29 04:04:19,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 04:04:19,326 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:19,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:19,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1507539594, now seen corresponding path program 1 times [2023-11-29 04:04:19,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:04:19,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337940892] [2023-11-29 04:04:19,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:19,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:04:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:04:19,381 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:04:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:04:19,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:04:19,479 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 04:04:19,480 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (76 of 77 remaining) [2023-11-29 04:04:19,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 77 remaining) [2023-11-29 04:04:19,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 77 remaining) [2023-11-29 04:04:19,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 77 remaining) [2023-11-29 04:04:19,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 77 remaining) [2023-11-29 04:04:19,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 77 remaining) [2023-11-29 04:04:19,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 77 remaining) [2023-11-29 04:04:19,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 77 remaining) [2023-11-29 04:04:19,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 77 remaining) [2023-11-29 04:04:19,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 77 remaining) [2023-11-29 04:04:19,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 77 remaining) [2023-11-29 04:04:19,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 77 remaining) [2023-11-29 04:04:19,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 77 remaining) [2023-11-29 04:04:19,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 77 remaining) [2023-11-29 04:04:19,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 77 remaining) [2023-11-29 04:04:19,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 77 remaining) [2023-11-29 04:04:19,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 77 remaining) [2023-11-29 04:04:19,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 77 remaining) [2023-11-29 04:04:19,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 77 remaining) [2023-11-29 04:04:19,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 77 remaining) [2023-11-29 04:04:19,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 77 remaining) [2023-11-29 04:04:19,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 77 remaining) [2023-11-29 04:04:19,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 77 remaining) [2023-11-29 04:04:19,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 77 remaining) [2023-11-29 04:04:19,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 77 remaining) [2023-11-29 04:04:19,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 77 remaining) [2023-11-29 04:04:19,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 77 remaining) [2023-11-29 04:04:19,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 77 remaining) [2023-11-29 04:04:19,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 77 remaining) [2023-11-29 04:04:19,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 77 remaining) [2023-11-29 04:04:19,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 77 remaining) [2023-11-29 04:04:19,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 77 remaining) [2023-11-29 04:04:19,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 77 remaining) [2023-11-29 04:04:19,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 77 remaining) [2023-11-29 04:04:19,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 77 remaining) [2023-11-29 04:04:19,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 77 remaining) [2023-11-29 04:04:19,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 77 remaining) [2023-11-29 04:04:19,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 77 remaining) [2023-11-29 04:04:19,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 77 remaining) [2023-11-29 04:04:19,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 77 remaining) [2023-11-29 04:04:19,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 77 remaining) [2023-11-29 04:04:19,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 77 remaining) [2023-11-29 04:04:19,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 77 remaining) [2023-11-29 04:04:19,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (33 of 77 remaining) [2023-11-29 04:04:19,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 77 remaining) [2023-11-29 04:04:19,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 77 remaining) [2023-11-29 04:04:19,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 77 remaining) [2023-11-29 04:04:19,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 77 remaining) [2023-11-29 04:04:19,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 77 remaining) [2023-11-29 04:04:19,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 77 remaining) [2023-11-29 04:04:19,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 77 remaining) [2023-11-29 04:04:19,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 77 remaining) [2023-11-29 04:04:19,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 77 remaining) [2023-11-29 04:04:19,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 77 remaining) [2023-11-29 04:04:19,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 77 remaining) [2023-11-29 04:04:19,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 77 remaining) [2023-11-29 04:04:19,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 77 remaining) [2023-11-29 04:04:19,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 77 remaining) [2023-11-29 04:04:19,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 77 remaining) [2023-11-29 04:04:19,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 77 remaining) [2023-11-29 04:04:19,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 77 remaining) [2023-11-29 04:04:19,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 77 remaining) [2023-11-29 04:04:19,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 77 remaining) [2023-11-29 04:04:19,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 77 remaining) [2023-11-29 04:04:19,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 77 remaining) [2023-11-29 04:04:19,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 77 remaining) [2023-11-29 04:04:19,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 77 remaining) [2023-11-29 04:04:19,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 77 remaining) [2023-11-29 04:04:19,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 77 remaining) [2023-11-29 04:04:19,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 77 remaining) [2023-11-29 04:04:19,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 77 remaining) [2023-11-29 04:04:19,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 77 remaining) [2023-11-29 04:04:19,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 77 remaining) [2023-11-29 04:04:19,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 77 remaining) [2023-11-29 04:04:19,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 77 remaining) [2023-11-29 04:04:19,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 77 remaining) [2023-11-29 04:04:19,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 77 remaining) [2023-11-29 04:04:19,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 04:04:19,492 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:04:19,498 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 04:04:19,498 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:04:19,557 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre22 could not be translated [2023-11-29 04:04:19,560 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre24 could not be translated [2023-11-29 04:04:19,566 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre26 could not be translated [2023-11-29 04:04:19,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:04:19 BasicIcfg [2023-11-29 04:04:19,590 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:04:19,590 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:04:19,590 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:04:19,591 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:04:19,591 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:03:53" (3/4) ... [2023-11-29 04:04:19,593 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 04:04:19,594 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:04:19,594 INFO L158 Benchmark]: Toolchain (without parser) took 28119.68ms. Allocated memory was 153.1MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 104.0MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 298.6MB. Max. memory is 16.1GB. [2023-11-29 04:04:19,594 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 153.1MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:04:19,595 INFO L158 Benchmark]: CACSL2BoogieTranslator took 490.44ms. Allocated memory is still 153.1MB. Free memory was 103.7MB in the beginning and 79.4MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-29 04:04:19,595 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.82ms. Allocated memory is still 153.1MB. Free memory was 79.4MB in the beginning and 77.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:04:19,595 INFO L158 Benchmark]: Boogie Preprocessor took 58.74ms. Allocated memory is still 153.1MB. Free memory was 76.7MB in the beginning and 72.8MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:04:19,596 INFO L158 Benchmark]: RCFGBuilder took 1158.20ms. Allocated memory was 153.1MB in the beginning and 195.0MB in the end (delta: 41.9MB). Free memory was 72.8MB in the beginning and 143.5MB in the end (delta: -70.7MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. [2023-11-29 04:04:19,596 INFO L158 Benchmark]: TraceAbstraction took 26354.42ms. Allocated memory was 195.0MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 142.4MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 293.1MB. Max. memory is 16.1GB. [2023-11-29 04:04:19,596 INFO L158 Benchmark]: Witness Printer took 3.27ms. Allocated memory is still 2.3GB. Free memory is still 1.9GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:04:19,598 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.19ms. Allocated memory is still 153.1MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 490.44ms. Allocated memory is still 153.1MB. Free memory was 103.7MB in the beginning and 79.4MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.82ms. Allocated memory is still 153.1MB. Free memory was 79.4MB in the beginning and 77.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.74ms. Allocated memory is still 153.1MB. Free memory was 76.7MB in the beginning and 72.8MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1158.20ms. Allocated memory was 153.1MB in the beginning and 195.0MB in the end (delta: 41.9MB). Free memory was 72.8MB in the beginning and 143.5MB in the end (delta: -70.7MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. * TraceAbstraction took 26354.42ms. Allocated memory was 195.0MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 142.4MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 293.1MB. Max. memory is 16.1GB. * Witness Printer took 3.27ms. Allocated memory is still 2.3GB. Free memory is still 1.9GB. 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~pre22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre24 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre26 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_p1_EAX = 0; [L734] 0 int __unbuffered_p1_EBX = 0; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L738] 0 int x = 0; [L739] 0 _Bool x$flush_delayed; [L740] 0 int x$mem_tmp; [L741] 0 _Bool x$r_buff0_thd0; [L742] 0 _Bool x$r_buff0_thd1; [L743] 0 _Bool x$r_buff0_thd2; [L744] 0 _Bool x$r_buff0_thd3; [L745] 0 _Bool x$r_buff1_thd0; [L746] 0 _Bool x$r_buff1_thd1; [L747] 0 _Bool x$r_buff1_thd2; [L748] 0 _Bool x$r_buff1_thd3; [L749] 0 _Bool x$read_delayed; [L750] 0 int *x$read_delayed_var; [L751] 0 int x$w_buff0; [L752] 0 _Bool x$w_buff0_used; [L753] 0 int x$w_buff1; [L754] 0 _Bool x$w_buff1_used; [L756] 0 int y = 0; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L849] 0 pthread_t t1749; [L850] FCALL, FORK 0 pthread_create(&t1749, ((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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1749={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L851] 0 pthread_t t1750; [L852] FCALL, FORK 0 pthread_create(&t1750, ((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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1749={6:0}, t1750={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 x$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(x) [L766] 1 x$mem_tmp = x [L767] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] EXPR 1 \read(x) [L767] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L769] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L770] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L771] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L773] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L775] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L776] EXPR 1 \read(x) [L776] 1 __unbuffered_p0_EAX = x [L777] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L777] EXPR 1 \read(x) [L777] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L777] 1 x = x$flush_delayed ? x$mem_tmp : x [L778] 1 x$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_p1_EAX=0, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L853] 0 pthread_t t1751; [L781] 1 __unbuffered_p0_EBX = y 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_p1_EAX=0, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L793] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_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_p1_EAX=0, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L796] 2 __unbuffered_p1_EAX = y 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_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L799] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L800] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L801] 2 x$flush_delayed = weak$$choice2 [L802] EXPR 2 \read(x) [L802] 2 x$mem_tmp = x [L803] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] EXPR 2 \read(x) [L803] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L804] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L805] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L806] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L807] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L808] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L809] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L810] EXPR 2 \read(x) [L810] 2 __unbuffered_p1_EBX = x [L811] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L811] 2 x = x$flush_delayed ? x$mem_tmp : x [L812] 2 x$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_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L854] FCALL, FORK 0 pthread_create(&t1751, ((void *)0), P2, ((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=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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1749={6:0}, t1750={7:0}, t1751={5:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L824] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_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_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$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_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [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_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L817] 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_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L834] 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_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L856] 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_p1_EAX=1, __unbuffered_p1_EBX=0, 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, t1749={6:0}, t1750={7:0}, t1751={5:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__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_p1_EAX=1, __unbuffered_p1_EBX=0, 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, t1749={6:0}, t1750={7:0}, t1751={5:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L868] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L868] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L869] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 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_p1_EAX=1, __unbuffered_p1_EBX=0, 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, t1749={6:0}, t1750={7:0}, t1751={5:0}, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L871] 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_p1_EAX=1, __unbuffered_p1_EBX=0, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L18] 0 __assert_fail ("0", "rfi009_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_p1_EAX=1, __unbuffered_p1_EBX=0, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - 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: -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: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 852]: 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: 850]: 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: 854]: 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, 141 locations, 77 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 26.1s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 20.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1363 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1164 mSDsluCounter, 111 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 82 mSDsCounter, 130 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3058 IncrementalHoareTripleChecker+Invalid, 3188 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 130 mSolverCounterUnsat, 29 mSDtfsCounter, 3058 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=376occurred in iteration=13, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 374 NumberOfCodeBlocks, 374 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 319 ConstructedInterpolants, 0 QuantifiedInterpolants, 3135 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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-29 04:04:19,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi009_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya --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 6efd977ba774fd706e089a911dcd82549d76c764859cf8b84047b990ab28d067 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:04:21,594 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:04:21,660 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 04:04:21,671 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:04:21,672 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:04:21,699 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:04:21,700 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:04:21,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:04:21,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:04:21,702 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:04:21,703 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:04:21,703 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:04:21,704 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:04:21,704 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:04:21,705 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:04:21,706 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:04:21,706 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:04:21,707 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:04:21,707 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:04:21,708 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:04:21,708 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:04:21,709 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:04:21,709 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:04:21,709 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:04:21,709 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:04:21,710 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 04:04:21,710 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 04:04:21,711 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:04:21,711 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:04:21,712 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:04:21,712 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:04:21,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:04:21,713 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:04:21,713 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:04:21,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:04:21,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:04:21,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:04:21,714 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 04:04:21,714 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 04:04:21,715 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:04:21,715 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:04:21,715 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:04:21,715 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:04:21,716 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 04:04:21,716 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_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 6efd977ba774fd706e089a911dcd82549d76c764859cf8b84047b990ab28d067 [2023-11-29 04:04:21,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:04:22,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:04:22,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:04:22,018 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:04:22,019 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:04:22,020 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/rfi009_rmo.oepc.i [2023-11-29 04:04:24,827 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:04:25,133 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:04:25,134 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/sv-benchmarks/c/pthread-wmm/rfi009_rmo.oepc.i [2023-11-29 04:04:25,160 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/data/6521cc795/c7edd98987fd46dea53b7b6922a088dc/FLAGe9f80671f [2023-11-29 04:04:25,174 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/data/6521cc795/c7edd98987fd46dea53b7b6922a088dc [2023-11-29 04:04:25,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:04:25,179 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:04:25,180 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:04:25,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:04:25,187 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:04:25,187 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:04:25" (1/1) ... [2023-11-29 04:04:25,188 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e342f29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:04:25, skipping insertion in model container [2023-11-29 04:04:25,189 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:04:25" (1/1) ... [2023-11-29 04:04:25,263 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:04:25,673 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:04:25,692 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:04:25,749 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:04:25,803 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:04:25,804 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:04:25,812 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:04:25,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:04:25 WrapperNode [2023-11-29 04:04:25,813 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:04:25,814 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:04:25,814 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:04:25,814 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:04:25,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:04:25" (1/1) ... [2023-11-29 04:04:25,847 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:04:25" (1/1) ... [2023-11-29 04:04:25,877 INFO L138 Inliner]: procedures = 180, calls = 74, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141 [2023-11-29 04:04:25,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:04:25,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:04:25,879 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:04:25,879 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:04:25,893 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:04:25" (1/1) ... [2023-11-29 04:04:25,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:04:25" (1/1) ... [2023-11-29 04:04:25,899 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:04:25" (1/1) ... [2023-11-29 04:04:25,924 INFO L175 MemorySlicer]: Split 24 memory accesses to 5 slices as follows [2, 1, 19, 1, 1]. 79 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1, 0, 0]. The 10 writes are split as follows [0, 1, 7, 1, 1]. [2023-11-29 04:04:25,924 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:04:25" (1/1) ... [2023-11-29 04:04:25,925 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:04:25" (1/1) ... [2023-11-29 04:04:25,941 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:04:25" (1/1) ... [2023-11-29 04:04:25,944 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:04:25" (1/1) ... [2023-11-29 04:04:25,949 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:04:25" (1/1) ... [2023-11-29 04:04:25,952 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:04:25" (1/1) ... [2023-11-29 04:04:25,959 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:04:25,960 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:04:25,960 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:04:25,961 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:04:25,962 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:04:25" (1/1) ... [2023-11-29 04:04:25,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:04:25,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:04:25,999 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:04:26,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:04:26,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 04:04:26,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 04:04:26,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 04:04:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 04:04:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-11-29 04:04:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 04:04:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:04:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:04:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:04:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 04:04:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 04:04:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 04:04:26,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 04:04:26,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-29 04:04:26,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 04:04:26,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 04:04:26,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 04:04:26,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 04:04:26,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-29 04:04:26,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-11-29 04:04:26,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-11-29 04:04:26,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-11-29 04:04:26,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-11-29 04:04:26,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2023-11-29 04:04:26,050 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 04:04:26,051 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 04:04:26,051 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 04:04:26,051 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 04:04:26,051 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 04:04:26,052 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 04:04:26,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 04:04:26,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:04:26,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:04:26,054 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 04:04:26,238 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:04:26,240 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:04:26,937 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:04:27,572 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:04:27,572 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 04:04:27,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:04:27 BoogieIcfgContainer [2023-11-29 04:04:27,573 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:04:27,576 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:04:27,576 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:04:27,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:04:27,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:04:25" (1/3) ... [2023-11-29 04:04:27,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d0df9bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:04:27, skipping insertion in model container [2023-11-29 04:04:27,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:04:25" (2/3) ... [2023-11-29 04:04:27,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d0df9bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:04:27, skipping insertion in model container [2023-11-29 04:04:27,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:04:27" (3/3) ... [2023-11-29 04:04:27,583 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi009_rmo.oepc.i [2023-11-29 04:04:27,602 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:04:27,602 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2023-11-29 04:04:27,602 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 04:04:27,747 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 04:04:27,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 88 transitions, 188 flow [2023-11-29 04:04:27,836 INFO L124 PetriNetUnfolderBase]: 2/85 cut-off events. [2023-11-29 04:04:27,837 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:04:27,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 85 events. 2/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 285 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2023-11-29 04:04:27,843 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 88 transitions, 188 flow [2023-11-29 04:04:27,849 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 85 transitions, 179 flow [2023-11-29 04:04:27,862 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:04:27,869 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;@f4c622b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:04:27,869 INFO L358 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2023-11-29 04:04:27,872 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 04:04:27,873 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 04:04:27,873 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:04:27,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:27,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 04:04:27,874 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:27,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:27,880 INFO L85 PathProgramCache]: Analyzing trace with hash 23562, now seen corresponding path program 1 times [2023-11-29 04:04:27,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:04:27,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803111089] [2023-11-29 04:04:27,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:27,894 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-29 04:04:27,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:04:27,895 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:27,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:28,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:04:28,071 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:04:28,134 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-29 04:04:28,148 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-29 04:04:28,148 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:04:28,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:04:28,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1803111089] [2023-11-29 04:04:28,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1803111089] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:28,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:28,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:04:28,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141500855] [2023-11-29 04:04:28,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:28,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:04:28,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:04:28,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:04:28,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:04:28,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 88 [2023-11-29 04:04:28,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 85 transitions, 179 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:28,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:28,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 88 [2023-11-29 04:04:28,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:31,660 INFO L124 PetriNetUnfolderBase]: 9214/14346 cut-off events. [2023-11-29 04:04:31,660 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-29 04:04:31,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27439 conditions, 14346 events. 9214/14346 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 1466. Compared 119273 event pairs, 7964 based on Foata normal form. 500/7829 useless extension candidates. Maximal degree in co-relation 27425. Up to 11276 conditions per place. [2023-11-29 04:04:31,843 INFO L140 encePairwiseOnDemand]: 63/88 looper letters, 53 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2023-11-29 04:04:31,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 78 transitions, 275 flow [2023-11-29 04:04:31,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:04:31,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:04:31,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2023-11-29 04:04:31,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-29 04:04:31,861 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 176 transitions. [2023-11-29 04:04:31,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 176 transitions. [2023-11-29 04:04:31,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:31,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 176 transitions. [2023-11-29 04:04:31,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 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-29 04:04:31,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:31,874 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:31,876 INFO L175 Difference]: Start difference. First operand has 93 places, 85 transitions, 179 flow. Second operand 3 states and 176 transitions. [2023-11-29 04:04:31,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 78 transitions, 275 flow [2023-11-29 04:04:31,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 78 transitions, 272 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 04:04:31,888 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 132 flow [2023-11-29 04:04:31,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2023-11-29 04:04:31,895 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -23 predicate places. [2023-11-29 04:04:31,896 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 132 flow [2023-11-29 04:04:31,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:31,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:31,896 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 04:04:31,900 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:04:32,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:32,098 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:32,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:32,099 INFO L85 PathProgramCache]: Analyzing trace with hash 23563, now seen corresponding path program 1 times [2023-11-29 04:04:32,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:04:32,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1243981826] [2023-11-29 04:04:32,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:32,100 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-29 04:04:32,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:04:32,101 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:32,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:32,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:32,267 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:04:32,269 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:04:32,283 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-29 04:04:32,296 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-29 04:04:32,297 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:04:32,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:04:32,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1243981826] [2023-11-29 04:04:32,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1243981826] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:32,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:32,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:04:32,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918991839] [2023-11-29 04:04:32,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:32,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:04:32,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:04:32,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:04:32,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:04:32,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2023-11-29 04:04:32,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 132 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-29 04:04:32,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:32,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2023-11-29 04:04:32,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:34,943 INFO L124 PetriNetUnfolderBase]: 9214/14345 cut-off events. [2023-11-29 04:04:34,943 INFO L125 PetriNetUnfolderBase]: For 250/250 co-relation queries the response was YES. [2023-11-29 04:04:34,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27686 conditions, 14345 events. 9214/14345 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 1466. Compared 119182 event pairs, 7964 based on Foata normal form. 1/7329 useless extension candidates. Maximal degree in co-relation 27675. Up to 11275 conditions per place. [2023-11-29 04:04:35,051 INFO L140 encePairwiseOnDemand]: 85/88 looper letters, 52 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2023-11-29 04:04:35,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 77 transitions, 272 flow [2023-11-29 04:04:35,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:04:35,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:04:35,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2023-11-29 04:04:35,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2023-11-29 04:04:35,055 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 136 transitions. [2023-11-29 04:04:35,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 136 transitions. [2023-11-29 04:04:35,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:35,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 136 transitions. [2023-11-29 04:04:35,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:35,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:35,060 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:35,061 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 132 flow. Second operand 3 states and 136 transitions. [2023-11-29 04:04:35,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 77 transitions, 272 flow [2023-11-29 04:04:35,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 77 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:04:35,092 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 130 flow [2023-11-29 04:04:35,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2023-11-29 04:04:35,093 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -24 predicate places. [2023-11-29 04:04:35,093 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 130 flow [2023-11-29 04:04:35,093 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-29 04:04:35,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:35,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:04:35,096 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 04:04:35,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:35,297 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:35,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:35,298 INFO L85 PathProgramCache]: Analyzing trace with hash 702713361, now seen corresponding path program 1 times [2023-11-29 04:04:35,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:04:35,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1356249018] [2023-11-29 04:04:35,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:35,299 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-29 04:04:35,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:04:35,300 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:35,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:35,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:35,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:04:35,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:04:35,474 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-29 04:04:35,480 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-29 04:04:35,481 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:04:35,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:04:35,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1356249018] [2023-11-29 04:04:35,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1356249018] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:35,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:35,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:04:35,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165863663] [2023-11-29 04:04:35,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:35,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:04:35,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:04:35,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:04:35,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:04:35,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 88 [2023-11-29 04:04:35,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:35,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:35,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 88 [2023-11-29 04:04:35,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:37,536 INFO L124 PetriNetUnfolderBase]: 9218/14344 cut-off events. [2023-11-29 04:04:37,537 INFO L125 PetriNetUnfolderBase]: For 250/250 co-relation queries the response was YES. [2023-11-29 04:04:37,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27694 conditions, 14344 events. 9218/14344 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 1466. Compared 119825 event pairs, 5720 based on Foata normal form. 0/7336 useless extension candidates. Maximal degree in co-relation 27683. Up to 11278 conditions per place. [2023-11-29 04:04:37,625 INFO L140 encePairwiseOnDemand]: 85/88 looper letters, 53 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2023-11-29 04:04:37,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 76 transitions, 272 flow [2023-11-29 04:04:37,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:04:37,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:04:37,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2023-11-29 04:04:37,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075757575757576 [2023-11-29 04:04:37,628 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 134 transitions. [2023-11-29 04:04:37,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 134 transitions. [2023-11-29 04:04:37,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:37,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 134 transitions. [2023-11-29 04:04:37,629 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-29 04:04:37,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:37,631 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:37,631 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 130 flow. Second operand 3 states and 134 transitions. [2023-11-29 04:04:37,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 76 transitions, 272 flow [2023-11-29 04:04:37,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 76 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:04:37,649 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 128 flow [2023-11-29 04:04:37,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, 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-29 04:04:37,650 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -25 predicate places. [2023-11-29 04:04:37,651 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 128 flow [2023-11-29 04:04:37,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:37,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:37,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:04:37,654 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 04:04:37,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:37,852 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:37,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:37,853 INFO L85 PathProgramCache]: Analyzing trace with hash 702713362, now seen corresponding path program 1 times [2023-11-29 04:04:37,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:04:37,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [107044004] [2023-11-29 04:04:37,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:37,854 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-29 04:04:37,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:04:37,855 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:37,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:37,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:04:37,995 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:04:38,007 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-29 04:04:38,019 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-29 04:04:38,020 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:04:38,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:04:38,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [107044004] [2023-11-29 04:04:38,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [107044004] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:38,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:38,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:04:38,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119905267] [2023-11-29 04:04:38,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:38,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:04:38,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:04:38,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:04:38,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:04:38,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2023-11-29 04:04:38,059 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.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-29 04:04:38,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:38,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2023-11-29 04:04:38,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:40,426 INFO L124 PetriNetUnfolderBase]: 9214/14279 cut-off events. [2023-11-29 04:04:40,426 INFO L125 PetriNetUnfolderBase]: For 254/254 co-relation queries the response was YES. [2023-11-29 04:04:40,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27624 conditions, 14279 events. 9214/14279 cut-off events. For 254/254 co-relation queries the response was YES. Maximal size of possible extension queue 1466. Compared 121666 event pairs, 8010 based on Foata normal form. 5/7274 useless extension candidates. Maximal degree in co-relation 27614. Up to 11269 conditions per place. [2023-11-29 04:04:40,558 INFO L140 encePairwiseOnDemand]: 85/88 looper letters, 52 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2023-11-29 04:04:40,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 75 transitions, 268 flow [2023-11-29 04:04:40,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:04:40,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:04:40,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2023-11-29 04:04:40,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2023-11-29 04:04:40,560 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 136 transitions. [2023-11-29 04:04:40,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 136 transitions. [2023-11-29 04:04:40,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:40,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 136 transitions. [2023-11-29 04:04:40,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:40,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:40,563 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:40,563 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 128 flow. Second operand 3 states and 136 transitions. [2023-11-29 04:04:40,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 75 transitions, 268 flow [2023-11-29 04:04:40,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 75 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:04:40,584 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 126 flow [2023-11-29 04:04:40,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, 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-29 04:04:40,586 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -26 predicate places. [2023-11-29 04:04:40,586 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 126 flow [2023-11-29 04:04:40,586 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-29 04:04:40,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:40,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:04:40,590 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:40,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:40,788 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:40,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:40,788 INFO L85 PathProgramCache]: Analyzing trace with hash 702713479, now seen corresponding path program 1 times [2023-11-29 04:04:40,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:04:40,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018320785] [2023-11-29 04:04:40,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:40,790 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-29 04:04:40,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:04:40,791 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:40,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:40,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:04:40,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:04:40,956 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-29 04:04:40,956 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-29 04:04:41,005 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-29 04:04:41,006 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:04:41,006 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:04:41,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2018320785] [2023-11-29 04:04:41,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2018320785] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:41,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:41,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:04:41,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102756495] [2023-11-29 04:04:41,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:41,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:04:41,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:04:41,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:04:41,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:04:41,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 88 [2023-11-29 04:04:41,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 126 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-29 04:04:41,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:41,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 88 [2023-11-29 04:04:41,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:42,204 INFO L124 PetriNetUnfolderBase]: 3959/6369 cut-off events. [2023-11-29 04:04:42,205 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2023-11-29 04:04:42,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12262 conditions, 6369 events. 3959/6369 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 49206 event pairs, 3059 based on Foata normal form. 0/3952 useless extension candidates. Maximal degree in co-relation 12252. Up to 4120 conditions per place. [2023-11-29 04:04:42,259 INFO L140 encePairwiseOnDemand]: 79/88 looper letters, 45 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-29 04:04:42,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 68 transitions, 240 flow [2023-11-29 04:04:42,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:04:42,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:04:42,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2023-11-29 04:04:42,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2023-11-29 04:04:42,261 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 138 transitions. [2023-11-29 04:04:42,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 138 transitions. [2023-11-29 04:04:42,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:42,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 138 transitions. [2023-11-29 04:04:42,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:42,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:42,264 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:42,264 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 126 flow. Second operand 3 states and 138 transitions. [2023-11-29 04:04:42,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 68 transitions, 240 flow [2023-11-29 04:04:42,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 68 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:04:42,268 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 134 flow [2023-11-29 04:04:42,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, 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=134, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2023-11-29 04:04:42,270 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -27 predicate places. [2023-11-29 04:04:42,270 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 134 flow [2023-11-29 04:04:42,270 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-29 04:04:42,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:42,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:04:42,273 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 04:04:42,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:42,471 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:42,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:42,472 INFO L85 PathProgramCache]: Analyzing trace with hash 702713480, now seen corresponding path program 1 times [2023-11-29 04:04:42,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:04:42,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782713669] [2023-11-29 04:04:42,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:42,472 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-29 04:04:42,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:04:42,473 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:42,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 04:04:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:42,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 04:04:42,573 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:04:42,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:04:42,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 04:04:42,645 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-29 04:04:42,645 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:04:42,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:04:42,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782713669] [2023-11-29 04:04:42,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [782713669] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:42,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:42,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:04:42,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167443072] [2023-11-29 04:04:42,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:42,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:04:42,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:04:42,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:04:42,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:04:42,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 88 [2023-11-29 04:04:42,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 134 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-29 04:04:42,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:42,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 88 [2023-11-29 04:04:42,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:43,086 INFO L124 PetriNetUnfolderBase]: 1120/1941 cut-off events. [2023-11-29 04:04:43,086 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2023-11-29 04:04:43,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3945 conditions, 1941 events. 1120/1941 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 13303 event pairs, 1120 based on Foata normal form. 0/1792 useless extension candidates. Maximal degree in co-relation 3933. Up to 1693 conditions per place. [2023-11-29 04:04:43,096 INFO L140 encePairwiseOnDemand]: 80/88 looper letters, 27 selfloop transitions, 1 changer transitions 0/49 dead transitions. [2023-11-29 04:04:43,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 49 transitions, 176 flow [2023-11-29 04:04:43,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:04:43,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:04:43,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-29 04:04:43,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45075757575757575 [2023-11-29 04:04:43,098 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-29 04:04:43,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-29 04:04:43,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:43,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-29 04:04:43,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:43,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:43,101 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:43,101 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 134 flow. Second operand 3 states and 119 transitions. [2023-11-29 04:04:43,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 49 transitions, 176 flow [2023-11-29 04:04:43,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 49 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:04:43,104 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 118 flow [2023-11-29 04:04:43,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2023-11-29 04:04:43,105 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -34 predicate places. [2023-11-29 04:04:43,106 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 118 flow [2023-11-29 04:04:43,106 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-29 04:04:43,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:43,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:04:43,109 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 04:04:43,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:43,309 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:43,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:43,310 INFO L85 PathProgramCache]: Analyzing trace with hash 863916573, now seen corresponding path program 1 times [2023-11-29 04:04:43,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:04:43,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1476746185] [2023-11-29 04:04:43,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:43,310 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-29 04:04:43,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:04:43,311 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:43,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 04:04:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:43,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:04:43,426 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:04:43,432 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-29 04:04:43,438 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-29 04:04:43,439 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:04:43,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:04:43,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1476746185] [2023-11-29 04:04:43,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1476746185] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:43,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:43,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:04:43,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622392965] [2023-11-29 04:04:43,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:43,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:04:43,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:04:43,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:04:43,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:04:43,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 88 [2023-11-29 04:04:43,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:43,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:43,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 88 [2023-11-29 04:04:43,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:43,899 INFO L124 PetriNetUnfolderBase]: 1132/1932 cut-off events. [2023-11-29 04:04:43,899 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2023-11-29 04:04:43,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3921 conditions, 1932 events. 1132/1932 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 13098 event pairs, 734 based on Foata normal form. 0/1798 useless extension candidates. Maximal degree in co-relation 3914. Up to 1014 conditions per place. [2023-11-29 04:04:43,913 INFO L140 encePairwiseOnDemand]: 85/88 looper letters, 34 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-29 04:04:43,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 55 transitions, 202 flow [2023-11-29 04:04:43,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:04:43,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:04:43,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2023-11-29 04:04:43,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4356060606060606 [2023-11-29 04:04:43,915 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 115 transitions. [2023-11-29 04:04:43,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 115 transitions. [2023-11-29 04:04:43,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:43,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 115 transitions. [2023-11-29 04:04:43,916 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-29 04:04:43,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:43,917 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:43,918 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 118 flow. Second operand 3 states and 115 transitions. [2023-11-29 04:04:43,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 55 transitions, 202 flow [2023-11-29 04:04:43,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 55 transitions, 201 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:04:43,920 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 119 flow [2023-11-29 04:04:43,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2023-11-29 04:04:43,921 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -34 predicate places. [2023-11-29 04:04:43,921 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 119 flow [2023-11-29 04:04:43,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:43,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:43,922 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:04:43,925 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 04:04:44,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:44,124 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:44,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:44,124 INFO L85 PathProgramCache]: Analyzing trace with hash 863916574, now seen corresponding path program 1 times [2023-11-29 04:04:44,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:04:44,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090560281] [2023-11-29 04:04:44,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:44,126 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-29 04:04:44,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:04:44,127 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:44,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 04:04:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:44,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:04:44,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:04:44,285 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-29 04:04:44,297 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-29 04:04:44,297 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:04:44,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:04:44,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2090560281] [2023-11-29 04:04:44,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2090560281] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:44,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:44,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:04:44,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875468994] [2023-11-29 04:04:44,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:44,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:04:44,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:04:44,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:04:44,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:04:44,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2023-11-29 04:04:44,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 119 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-29 04:04:44,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:44,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2023-11-29 04:04:44,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:44,761 INFO L124 PetriNetUnfolderBase]: 1120/1911 cut-off events. [2023-11-29 04:04:44,761 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2023-11-29 04:04:44,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3924 conditions, 1911 events. 1120/1911 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 12877 event pairs, 728 based on Foata normal form. 9/1789 useless extension candidates. Maximal degree in co-relation 3917. Up to 993 conditions per place. [2023-11-29 04:04:44,770 INFO L140 encePairwiseOnDemand]: 85/88 looper letters, 33 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-29 04:04:44,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 54 transitions, 201 flow [2023-11-29 04:04:44,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:04:44,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:04:44,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-29 04:04:44,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4431818181818182 [2023-11-29 04:04:44,772 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-29 04:04:44,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-29 04:04:44,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:44,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-29 04:04:44,773 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-29 04:04:44,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:44,774 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:44,774 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 119 flow. Second operand 3 states and 117 transitions. [2023-11-29 04:04:44,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 54 transitions, 201 flow [2023-11-29 04:04:44,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 54 transitions, 197 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:04:44,777 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 117 flow [2023-11-29 04:04:44,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2023-11-29 04:04:44,778 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -35 predicate places. [2023-11-29 04:04:44,778 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 117 flow [2023-11-29 04:04:44,778 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-29 04:04:44,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:44,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:04:44,781 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 04:04:44,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:44,979 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:44,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:44,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1062505580, now seen corresponding path program 1 times [2023-11-29 04:04:44,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:04:44,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31925832] [2023-11-29 04:04:44,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:44,980 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-29 04:04:44,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:04:44,981 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:44,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 04:04:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:45,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:04:45,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:04:45,149 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-29 04:04:45,150 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:04:45,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:04:45,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31925832] [2023-11-29 04:04:45,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [31925832] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:45,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:45,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:04:45,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061593964] [2023-11-29 04:04:45,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:45,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:04:45,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:04:45,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:04:45,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:04:45,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2023-11-29 04:04:45,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:45,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:45,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2023-11-29 04:04:45,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:45,692 INFO L124 PetriNetUnfolderBase]: 2231/3642 cut-off events. [2023-11-29 04:04:45,692 INFO L125 PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES. [2023-11-29 04:04:45,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7373 conditions, 3642 events. 2231/3642 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 23587 event pairs, 247 based on Foata normal form. 80/3544 useless extension candidates. Maximal degree in co-relation 7366. Up to 2609 conditions per place. [2023-11-29 04:04:45,707 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 49 selfloop transitions, 5 changer transitions 1/70 dead transitions. [2023-11-29 04:04:45,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 70 transitions, 279 flow [2023-11-29 04:04:45,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:04:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:04:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2023-11-29 04:04:45,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4346590909090909 [2023-11-29 04:04:45,708 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 153 transitions. [2023-11-29 04:04:45,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 153 transitions. [2023-11-29 04:04:45,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:45,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 153 transitions. [2023-11-29 04:04:45,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 38.25) internal successors, (153), 4 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-29 04:04:45,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:45,710 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:45,711 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 117 flow. Second operand 4 states and 153 transitions. [2023-11-29 04:04:45,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 70 transitions, 279 flow [2023-11-29 04:04:45,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 70 transitions, 273 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:04:45,713 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 147 flow [2023-11-29 04:04:45,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-11-29 04:04:45,714 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -32 predicate places. [2023-11-29 04:04:45,714 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 147 flow [2023-11-29 04:04:45,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:45,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:45,715 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-29 04:04:45,718 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 04:04:45,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:45,915 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:45,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:45,916 INFO L85 PathProgramCache]: Analyzing trace with hash -951721463, now seen corresponding path program 1 times [2023-11-29 04:04:45,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:04:45,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822039459] [2023-11-29 04:04:45,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:45,916 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-29 04:04:45,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:04:45,917 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:45,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 04:04:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:46,053 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:04:46,055 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:04:46,108 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-29 04:04:46,109 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:04:46,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:04:46,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [822039459] [2023-11-29 04:04:46,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [822039459] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:46,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:46,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:04:46,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569076589] [2023-11-29 04:04:46,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:46,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:04:46,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:04:46,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:04:46,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:04:46,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2023-11-29 04:04:46,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 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-29 04:04:46,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:46,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2023-11-29 04:04:46,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:46,550 INFO L124 PetriNetUnfolderBase]: 1195/2030 cut-off events. [2023-11-29 04:04:46,550 INFO L125 PetriNetUnfolderBase]: For 436/436 co-relation queries the response was YES. [2023-11-29 04:04:46,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4560 conditions, 2030 events. 1195/2030 cut-off events. For 436/436 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11564 event pairs, 87 based on Foata normal form. 68/2008 useless extension candidates. Maximal degree in co-relation 4550. Up to 1141 conditions per place. [2023-11-29 04:04:46,561 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 59 selfloop transitions, 8 changer transitions 1/83 dead transitions. [2023-11-29 04:04:46,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 83 transitions, 370 flow [2023-11-29 04:04:46,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:04:46,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:04:46,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 190 transitions. [2023-11-29 04:04:46,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2023-11-29 04:04:46,563 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 190 transitions. [2023-11-29 04:04:46,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 190 transitions. [2023-11-29 04:04:46,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:46,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 190 transitions. [2023-11-29 04:04:46,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:46,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 88.0) internal successors, (528), 6 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:46,565 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 88.0) internal successors, (528), 6 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:46,565 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 147 flow. Second operand 5 states and 190 transitions. [2023-11-29 04:04:46,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 83 transitions, 370 flow [2023-11-29 04:04:46,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 83 transitions, 360 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 04:04:46,568 INFO L231 Difference]: Finished difference. Result has 65 places, 53 transitions, 187 flow [2023-11-29 04:04:46,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=65, PETRI_TRANSITIONS=53} [2023-11-29 04:04:46,569 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -28 predicate places. [2023-11-29 04:04:46,569 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 53 transitions, 187 flow [2023-11-29 04:04:46,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 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-29 04:04:46,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:46,569 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-29 04:04:46,573 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 04:04:46,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:46,770 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:46,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:46,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1265521903, now seen corresponding path program 1 times [2023-11-29 04:04:46,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:04:46,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1498387043] [2023-11-29 04:04:46,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:46,771 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-29 04:04:46,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:04:46,772 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:46,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 04:04:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:46,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:04:46,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:04:46,944 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-29 04:04:46,944 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:04:46,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:04:46,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1498387043] [2023-11-29 04:04:46,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1498387043] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:46,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:46,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:04:46,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389791578] [2023-11-29 04:04:46,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:46,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:04:46,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:04:46,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:04:46,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:04:46,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2023-11-29 04:04:46,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 53 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:46,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:46,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2023-11-29 04:04:46,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:47,330 INFO L124 PetriNetUnfolderBase]: 523/894 cut-off events. [2023-11-29 04:04:47,331 INFO L125 PetriNetUnfolderBase]: For 668/668 co-relation queries the response was YES. [2023-11-29 04:04:47,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2280 conditions, 894 events. 523/894 cut-off events. For 668/668 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3930 event pairs, 53 based on Foata normal form. 36/904 useless extension candidates. Maximal degree in co-relation 2268. Up to 268 conditions per place. [2023-11-29 04:04:47,334 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 47 selfloop transitions, 11 changer transitions 2/75 dead transitions. [2023-11-29 04:04:47,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 75 transitions, 351 flow [2023-11-29 04:04:47,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:04:47,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:04:47,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2023-11-29 04:04:47,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39015151515151514 [2023-11-29 04:04:47,335 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 206 transitions. [2023-11-29 04:04:47,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 206 transitions. [2023-11-29 04:04:47,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:47,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 206 transitions. [2023-11-29 04:04:47,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:47,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:47,337 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:47,338 INFO L175 Difference]: Start difference. First operand has 65 places, 53 transitions, 187 flow. Second operand 6 states and 206 transitions. [2023-11-29 04:04:47,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 75 transitions, 351 flow [2023-11-29 04:04:47,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 75 transitions, 324 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-11-29 04:04:47,340 INFO L231 Difference]: Finished difference. Result has 62 places, 47 transitions, 177 flow [2023-11-29 04:04:47,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=177, PETRI_PLACES=62, PETRI_TRANSITIONS=47} [2023-11-29 04:04:47,341 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -31 predicate places. [2023-11-29 04:04:47,341 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 177 flow [2023-11-29 04:04:47,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:47,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:47,341 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] [2023-11-29 04:04:47,344 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 04:04:47,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:47,542 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:47,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:47,542 INFO L85 PathProgramCache]: Analyzing trace with hash -969479292, now seen corresponding path program 1 times [2023-11-29 04:04:47,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:04:47,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [173364534] [2023-11-29 04:04:47,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:47,543 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-29 04:04:47,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:04:47,544 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:47,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 04:04:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:47,708 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:04:47,710 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:04:47,762 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-29 04:04:47,762 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:04:47,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:04:47,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [173364534] [2023-11-29 04:04:47,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [173364534] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:47,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:47,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:04:47,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896382260] [2023-11-29 04:04:47,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:47,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:04:47,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:04:47,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:04:47,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:04:47,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 88 [2023-11-29 04:04:47,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 47 transitions, 177 flow. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:47,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:47,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 88 [2023-11-29 04:04:47,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:47,958 INFO L124 PetriNetUnfolderBase]: 290/625 cut-off events. [2023-11-29 04:04:47,958 INFO L125 PetriNetUnfolderBase]: For 301/311 co-relation queries the response was YES. [2023-11-29 04:04:47,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1383 conditions, 625 events. 290/625 cut-off events. For 301/311 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3073 event pairs, 120 based on Foata normal form. 0/587 useless extension candidates. Maximal degree in co-relation 1371. Up to 350 conditions per place. [2023-11-29 04:04:47,961 INFO L140 encePairwiseOnDemand]: 85/88 looper letters, 32 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-29 04:04:47,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 59 transitions, 273 flow [2023-11-29 04:04:47,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:04:47,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:04:47,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2023-11-29 04:04:47,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41761363636363635 [2023-11-29 04:04:47,963 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 147 transitions. [2023-11-29 04:04:47,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 147 transitions. [2023-11-29 04:04:47,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:47,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 147 transitions. [2023-11-29 04:04:47,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:47,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:47,965 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:47,966 INFO L175 Difference]: Start difference. First operand has 62 places, 47 transitions, 177 flow. Second operand 4 states and 147 transitions. [2023-11-29 04:04:47,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 59 transitions, 273 flow [2023-11-29 04:04:47,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 59 transitions, 217 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-11-29 04:04:47,969 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 123 flow [2023-11-29 04:04:47,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=123, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-29 04:04:47,970 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -38 predicate places. [2023-11-29 04:04:47,970 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 123 flow [2023-11-29 04:04:47,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:47,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:47,970 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] [2023-11-29 04:04:47,974 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 04:04:48,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:48,171 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:48,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:48,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1671240389, now seen corresponding path program 1 times [2023-11-29 04:04:48,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:04:48,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922929893] [2023-11-29 04:04:48,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:48,172 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-29 04:04:48,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:04:48,173 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:48,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 04:04:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:48,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:04:48,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:04:48,436 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-29 04:04:48,437 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:04:48,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:04:48,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1922929893] [2023-11-29 04:04:48,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1922929893] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:48,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:48,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:04:48,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278586775] [2023-11-29 04:04:48,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:48,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:04:48,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:04:48,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:04:48,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:04:48,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 88 [2023-11-29 04:04:48,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:48,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:48,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 88 [2023-11-29 04:04:48,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:48,647 INFO L124 PetriNetUnfolderBase]: 278/605 cut-off events. [2023-11-29 04:04:48,647 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-11-29 04:04:48,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1170 conditions, 605 events. 278/605 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3018 event pairs, 120 based on Foata normal form. 0/575 useless extension candidates. Maximal degree in co-relation 1163. Up to 350 conditions per place. [2023-11-29 04:04:48,650 INFO L140 encePairwiseOnDemand]: 85/88 looper letters, 28 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-29 04:04:48,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 55 transitions, 205 flow [2023-11-29 04:04:48,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:04:48,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:04:48,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2023-11-29 04:04:48,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2023-11-29 04:04:48,652 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 143 transitions. [2023-11-29 04:04:48,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 143 transitions. [2023-11-29 04:04:48,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:48,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 143 transitions. [2023-11-29 04:04:48,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:48,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:48,654 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:48,654 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 123 flow. Second operand 4 states and 143 transitions. [2023-11-29 04:04:48,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 55 transitions, 205 flow [2023-11-29 04:04:48,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:04:48,656 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 122 flow [2023-11-29 04:04:48,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2023-11-29 04:04:48,657 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -38 predicate places. [2023-11-29 04:04:48,657 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 122 flow [2023-11-29 04:04:48,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:48,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:48,657 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-29 04:04:48,661 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 04:04:48,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:48,858 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:48,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:48,858 INFO L85 PathProgramCache]: Analyzing trace with hash -162826584, now seen corresponding path program 1 times [2023-11-29 04:04:48,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:04:48,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860641958] [2023-11-29 04:04:48,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:48,859 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-29 04:04:48,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:04:48,860 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:48,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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 (15)] Waiting until timeout for monitored process [2023-11-29 04:04:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:49,123 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 04:04:49,126 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:04:50,455 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-29 04:04:50,456 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:04:50,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:04:50,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860641958] [2023-11-29 04:04:50,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1860641958] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:50,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:50,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:04:50,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979542759] [2023-11-29 04:04:50,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:50,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:04:50,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:04:50,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:04:50,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:04:51,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 88 [2023-11-29 04:04:51,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 122 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:51,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:51,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 88 [2023-11-29 04:04:51,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:52,536 INFO L124 PetriNetUnfolderBase]: 257/528 cut-off events. [2023-11-29 04:04:52,537 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-11-29 04:04:52,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1069 conditions, 528 events. 257/528 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2440 event pairs, 134 based on Foata normal form. 8/510 useless extension candidates. Maximal degree in co-relation 1061. Up to 361 conditions per place. [2023-11-29 04:04:52,539 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 22 selfloop transitions, 3 changer transitions 4/53 dead transitions. [2023-11-29 04:04:52,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 53 transitions, 200 flow [2023-11-29 04:04:52,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:04:52,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:04:52,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2023-11-29 04:04:52,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3181818181818182 [2023-11-29 04:04:52,542 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 168 transitions. [2023-11-29 04:04:52,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 168 transitions. [2023-11-29 04:04:52,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:52,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 168 transitions. [2023-11-29 04:04:52,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:52,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:52,544 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:52,544 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 122 flow. Second operand 6 states and 168 transitions. [2023-11-29 04:04:52,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 53 transitions, 200 flow [2023-11-29 04:04:52,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 53 transitions, 195 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:04:52,545 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 120 flow [2023-11-29 04:04:52,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=120, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2023-11-29 04:04:52,546 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -36 predicate places. [2023-11-29 04:04:52,546 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 120 flow [2023-11-29 04:04:52,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:52,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:52,547 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-29 04:04:52,551 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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 (15)] Forceful destruction successful, exit code 0 [2023-11-29 04:04:52,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:52,748 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:52,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:52,748 INFO L85 PathProgramCache]: Analyzing trace with hash 8526794, now seen corresponding path program 1 times [2023-11-29 04:04:52,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:04:52,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1817344551] [2023-11-29 04:04:52,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:52,749 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-29 04:04:52,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:04:52,750 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:52,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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 (16)] Waiting until timeout for monitored process [2023-11-29 04:04:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:52,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:04:52,982 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:04:53,043 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-29 04:04:53,043 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:04:53,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:04:53,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1817344551] [2023-11-29 04:04:53,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1817344551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:53,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:53,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:04:53,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136102085] [2023-11-29 04:04:53,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:53,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:04:53,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:04:53,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:04:53,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:04:53,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 88 [2023-11-29 04:04:53,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 43 transitions, 120 flow. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:53,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:53,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 88 [2023-11-29 04:04:53,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:53,498 INFO L124 PetriNetUnfolderBase]: 585/1200 cut-off events. [2023-11-29 04:04:53,498 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-11-29 04:04:53,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2365 conditions, 1200 events. 585/1200 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6858 event pairs, 116 based on Foata normal form. 8/1162 useless extension candidates. Maximal degree in co-relation 2357. Up to 471 conditions per place. [2023-11-29 04:04:53,503 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 27 selfloop transitions, 1 changer transitions 21/71 dead transitions. [2023-11-29 04:04:53,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 71 transitions, 283 flow [2023-11-29 04:04:53,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:04:53,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:04:53,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2023-11-29 04:04:53,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39015151515151514 [2023-11-29 04:04:53,505 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 206 transitions. [2023-11-29 04:04:53,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 206 transitions. [2023-11-29 04:04:53,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:53,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 206 transitions. [2023-11-29 04:04:53,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:53,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:53,507 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:53,508 INFO L175 Difference]: Start difference. First operand has 57 places, 43 transitions, 120 flow. Second operand 6 states and 206 transitions. [2023-11-29 04:04:53,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 71 transitions, 283 flow [2023-11-29 04:04:53,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 71 transitions, 276 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 04:04:53,510 INFO L231 Difference]: Finished difference. Result has 60 places, 43 transitions, 126 flow [2023-11-29 04:04:53,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=126, PETRI_PLACES=60, PETRI_TRANSITIONS=43} [2023-11-29 04:04:53,510 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -33 predicate places. [2023-11-29 04:04:53,510 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 43 transitions, 126 flow [2023-11-29 04:04:53,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:53,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:53,511 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-29 04:04:53,515 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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 (16)] Ended with exit code 0 [2023-11-29 04:04:53,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:53,711 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:53,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:53,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1667061484, now seen corresponding path program 2 times [2023-11-29 04:04:53,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:04:53,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002963780] [2023-11-29 04:04:53,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:04:53,713 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-29 04:04:53,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:04:53,714 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:53,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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 (17)] Waiting until timeout for monitored process [2023-11-29 04:04:53,915 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 04:04:53,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:04:53,922 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 04:04:53,926 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:04:54,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-29 04:04:54,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 04:04:54,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-29 04:04:54,368 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:04:54,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:04:54,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002963780] [2023-11-29 04:04:54,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1002963780] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:54,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:54,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:04:54,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506137937] [2023-11-29 04:04:54,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:54,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:04:54,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:04:54,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:04:54,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:04:54,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 88 [2023-11-29 04:04:54,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 43 transitions, 126 flow. Second operand has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:54,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:04:54,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 88 [2023-11-29 04:04:54,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:04:55,417 INFO L124 PetriNetUnfolderBase]: 533/1123 cut-off events. [2023-11-29 04:04:55,417 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-29 04:04:55,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2261 conditions, 1123 events. 533/1123 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6748 event pairs, 182 based on Foata normal form. 8/1049 useless extension candidates. Maximal degree in co-relation 2250. Up to 381 conditions per place. [2023-11-29 04:04:55,421 INFO L140 encePairwiseOnDemand]: 80/88 looper letters, 23 selfloop transitions, 4 changer transitions 22/73 dead transitions. [2023-11-29 04:04:55,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 73 transitions, 290 flow [2023-11-29 04:04:55,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:04:55,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 04:04:55,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 274 transitions. [2023-11-29 04:04:55,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38920454545454547 [2023-11-29 04:04:55,424 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 274 transitions. [2023-11-29 04:04:55,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 274 transitions. [2023-11-29 04:04:55,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:04:55,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 274 transitions. [2023-11-29 04:04:55,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:55,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 88.0) internal successors, (792), 9 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:55,426 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 88.0) internal successors, (792), 9 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:55,427 INFO L175 Difference]: Start difference. First operand has 60 places, 43 transitions, 126 flow. Second operand 8 states and 274 transitions. [2023-11-29 04:04:55,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 73 transitions, 290 flow [2023-11-29 04:04:55,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 73 transitions, 279 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 04:04:55,430 INFO L231 Difference]: Finished difference. Result has 65 places, 45 transitions, 151 flow [2023-11-29 04:04:55,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=151, PETRI_PLACES=65, PETRI_TRANSITIONS=45} [2023-11-29 04:04:55,431 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -28 predicate places. [2023-11-29 04:04:55,431 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 45 transitions, 151 flow [2023-11-29 04:04:55,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:04:55,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:04:55,432 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-29 04:04:55,437 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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 (17)] Ended with exit code 0 [2023-11-29 04:04:55,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:55,632 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 04:04:55,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:55,633 INFO L85 PathProgramCache]: Analyzing trace with hash 403000390, now seen corresponding path program 3 times [2023-11-29 04:04:55,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:04:55,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1149650900] [2023-11-29 04:04:55,633 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 04:04:55,633 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-29 04:04:55,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:04:55,635 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:55,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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 (18)] Waiting until timeout for monitored process [2023-11-29 04:04:55,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-29 04:04:55,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 04:04:55,886 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:04:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:04:56,128 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-29 04:04:56,128 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 04:04:56,129 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (76 of 77 remaining) [2023-11-29 04:04:56,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 77 remaining) [2023-11-29 04:04:56,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 77 remaining) [2023-11-29 04:04:56,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 77 remaining) [2023-11-29 04:04:56,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 77 remaining) [2023-11-29 04:04:56,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 77 remaining) [2023-11-29 04:04:56,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 77 remaining) [2023-11-29 04:04:56,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 77 remaining) [2023-11-29 04:04:56,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 77 remaining) [2023-11-29 04:04:56,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 77 remaining) [2023-11-29 04:04:56,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 77 remaining) [2023-11-29 04:04:56,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 77 remaining) [2023-11-29 04:04:56,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 77 remaining) [2023-11-29 04:04:56,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 77 remaining) [2023-11-29 04:04:56,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 77 remaining) [2023-11-29 04:04:56,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 77 remaining) [2023-11-29 04:04:56,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 77 remaining) [2023-11-29 04:04:56,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 77 remaining) [2023-11-29 04:04:56,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 77 remaining) [2023-11-29 04:04:56,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 77 remaining) [2023-11-29 04:04:56,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 77 remaining) [2023-11-29 04:04:56,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 77 remaining) [2023-11-29 04:04:56,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 77 remaining) [2023-11-29 04:04:56,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 77 remaining) [2023-11-29 04:04:56,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 77 remaining) [2023-11-29 04:04:56,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 77 remaining) [2023-11-29 04:04:56,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 77 remaining) [2023-11-29 04:04:56,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 77 remaining) [2023-11-29 04:04:56,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 77 remaining) [2023-11-29 04:04:56,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 77 remaining) [2023-11-29 04:04:56,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 77 remaining) [2023-11-29 04:04:56,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 77 remaining) [2023-11-29 04:04:56,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 77 remaining) [2023-11-29 04:04:56,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 77 remaining) [2023-11-29 04:04:56,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 77 remaining) [2023-11-29 04:04:56,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 77 remaining) [2023-11-29 04:04:56,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 77 remaining) [2023-11-29 04:04:56,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 77 remaining) [2023-11-29 04:04:56,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 77 remaining) [2023-11-29 04:04:56,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 77 remaining) [2023-11-29 04:04:56,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 77 remaining) [2023-11-29 04:04:56,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 77 remaining) [2023-11-29 04:04:56,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 77 remaining) [2023-11-29 04:04:56,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (33 of 77 remaining) [2023-11-29 04:04:56,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 77 remaining) [2023-11-29 04:04:56,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 77 remaining) [2023-11-29 04:04:56,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 77 remaining) [2023-11-29 04:04:56,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 77 remaining) [2023-11-29 04:04:56,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 77 remaining) [2023-11-29 04:04:56,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 77 remaining) [2023-11-29 04:04:56,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 77 remaining) [2023-11-29 04:04:56,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 77 remaining) [2023-11-29 04:04:56,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 77 remaining) [2023-11-29 04:04:56,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 77 remaining) [2023-11-29 04:04:56,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 77 remaining) [2023-11-29 04:04:56,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 77 remaining) [2023-11-29 04:04:56,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 77 remaining) [2023-11-29 04:04:56,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 77 remaining) [2023-11-29 04:04:56,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 77 remaining) [2023-11-29 04:04:56,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 77 remaining) [2023-11-29 04:04:56,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 77 remaining) [2023-11-29 04:04:56,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 77 remaining) [2023-11-29 04:04:56,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 77 remaining) [2023-11-29 04:04:56,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 77 remaining) [2023-11-29 04:04:56,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 77 remaining) [2023-11-29 04:04:56,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 77 remaining) [2023-11-29 04:04:56,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 77 remaining) [2023-11-29 04:04:56,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 77 remaining) [2023-11-29 04:04:56,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 77 remaining) [2023-11-29 04:04:56,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 77 remaining) [2023-11-29 04:04:56,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 77 remaining) [2023-11-29 04:04:56,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 77 remaining) [2023-11-29 04:04:56,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 77 remaining) [2023-11-29 04:04:56,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 77 remaining) [2023-11-29 04:04:56,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 77 remaining) [2023-11-29 04:04:56,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 77 remaining) [2023-11-29 04:04:56,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 77 remaining) [2023-11-29 04:04:56,150 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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 (18)] Ended with exit code 0 [2023-11-29 04:04:56,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:04:56,344 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:04:56,349 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 04:04:56,349 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:04:56,412 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre22 could not be translated [2023-11-29 04:04:56,415 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre24 could not be translated [2023-11-29 04:04:56,422 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre26 could not be translated [2023-11-29 04:04:56,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:04:56 BasicIcfg [2023-11-29 04:04:56,450 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:04:56,451 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:04:56,451 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:04:56,451 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:04:56,452 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:04:27" (3/4) ... [2023-11-29 04:04:56,453 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 04:04:56,454 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:04:56,455 INFO L158 Benchmark]: Toolchain (without parser) took 31276.20ms. Allocated memory was 100.7MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 76.1MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 254.4MB. Max. memory is 16.1GB. [2023-11-29 04:04:56,455 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 69.2MB. Free memory was 45.7MB in the beginning and 45.7MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:04:56,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 632.79ms. Allocated memory is still 100.7MB. Free memory was 75.9MB in the beginning and 73.9MB in the end (delta: 2.0MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. [2023-11-29 04:04:56,456 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.82ms. Allocated memory is still 100.7MB. Free memory was 73.9MB in the beginning and 71.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:04:56,456 INFO L158 Benchmark]: Boogie Preprocessor took 80.72ms. Allocated memory is still 100.7MB. Free memory was 71.4MB in the beginning and 67.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:04:56,457 INFO L158 Benchmark]: RCFGBuilder took 1613.26ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 67.2MB in the beginning and 43.4MB in the end (delta: 23.8MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. [2023-11-29 04:04:56,457 INFO L158 Benchmark]: TraceAbstraction took 28874.30ms. Allocated memory was 121.6MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 42.4MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 194.4MB. Max. memory is 16.1GB. [2023-11-29 04:04:56,457 INFO L158 Benchmark]: Witness Printer took 3.24ms. Allocated memory is still 2.0GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:04:56,460 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.28ms. Allocated memory is still 69.2MB. Free memory was 45.7MB in the beginning and 45.7MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 632.79ms. Allocated memory is still 100.7MB. Free memory was 75.9MB in the beginning and 73.9MB in the end (delta: 2.0MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.82ms. Allocated memory is still 100.7MB. Free memory was 73.9MB in the beginning and 71.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.72ms. Allocated memory is still 100.7MB. Free memory was 71.4MB in the beginning and 67.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1613.26ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 67.2MB in the beginning and 43.4MB in the end (delta: 23.8MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. * TraceAbstraction took 28874.30ms. Allocated memory was 121.6MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 42.4MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 194.4MB. Max. memory is 16.1GB. * Witness Printer took 3.24ms. Allocated memory is still 2.0GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre24 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre26 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_p1_EAX = 0; [L734] 0 int __unbuffered_p1_EBX = 0; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L738] 0 int x = 0; [L739] 0 _Bool x$flush_delayed; [L740] 0 int x$mem_tmp; [L741] 0 _Bool x$r_buff0_thd0; [L742] 0 _Bool x$r_buff0_thd1; [L743] 0 _Bool x$r_buff0_thd2; [L744] 0 _Bool x$r_buff0_thd3; [L745] 0 _Bool x$r_buff1_thd0; [L746] 0 _Bool x$r_buff1_thd1; [L747] 0 _Bool x$r_buff1_thd2; [L748] 0 _Bool x$r_buff1_thd3; [L749] 0 _Bool x$read_delayed; [L750] 0 int *x$read_delayed_var; [L751] 0 int x$w_buff0; [L752] 0 _Bool x$w_buff0_used; [L753] 0 int x$w_buff1; [L754] 0 _Bool x$w_buff1_used; [L756] 0 int y = 0; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L849] 0 pthread_t t1749; [L850] FCALL, FORK 0 pthread_create(&t1749, ((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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1749={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 x$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(x) [L766] 1 x$mem_tmp = x [L767] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] EXPR 1 \read(x) [L767] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L769] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L770] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L771] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L773] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L775] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L776] EXPR 1 \read(x) [L776] 1 __unbuffered_p0_EAX = x [L777] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L777] EXPR 1 \read(x) [L777] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L777] 1 x = x$flush_delayed ? x$mem_tmp : x [L778] 1 x$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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L851] 0 pthread_t t1750; [L852] FCALL, FORK 0 pthread_create(&t1750, ((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=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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1749={5:0}, t1750={6:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L781] 1 __unbuffered_p0_EBX = y 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_p1_EAX=0, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L793] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_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_p1_EAX=0, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L796] 2 __unbuffered_p1_EAX = y 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_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L799] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L800] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L801] 2 x$flush_delayed = weak$$choice2 [L802] EXPR 2 \read(x) [L802] 2 x$mem_tmp = x [L803] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] EXPR 2 \read(x) [L803] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L804] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L805] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L806] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L807] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L808] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L809] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L810] EXPR 2 \read(x) [L810] 2 __unbuffered_p1_EBX = x [L811] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L811] 2 x = x$flush_delayed ? x$mem_tmp : x [L812] 2 x$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_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L853] 0 pthread_t t1751; [L854] FCALL, FORK 0 pthread_create(&t1751, ((void *)0), P2, ((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=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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1749={5:0}, t1750={6:0}, t1751={-2147483646:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L824] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_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_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$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_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [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_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L817] 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_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L834] 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_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L856] 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_p1_EAX=1, __unbuffered_p1_EBX=0, 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, t1749={5:0}, t1750={6:0}, t1751={-2147483646:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__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_p1_EAX=1, __unbuffered_p1_EBX=0, 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, t1749={5:0}, t1750={6:0}, t1751={-2147483646:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L868] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L868] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L869] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 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_p1_EAX=1, __unbuffered_p1_EBX=0, 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, t1749={5:0}, t1750={6:0}, t1751={-2147483646:0}, weak$$choice1=2, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L871] 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_p1_EAX=1, __unbuffered_p1_EBX=0, 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=2, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L18] 0 __assert_fail ("0", "rfi009_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_p1_EAX=1, __unbuffered_p1_EBX=0, 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=2, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - 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: -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: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 854]: 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: 852]: 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: 850]: 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, 141 locations, 77 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: 28.6s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 19.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 843 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 681 mSDsluCounter, 228 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 213 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1740 IncrementalHoareTripleChecker+Invalid, 1814 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 15 mSDtfsCounter, 1740 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 253 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=187occurred in iteration=10, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 285 NumberOfCodeBlocks, 285 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 236 ConstructedInterpolants, 22 QuantifiedInterpolants, 2852 SizeOfPredicates, 19 NumberOfNonLiveVariables, 2343 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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-29 04:04:56,485 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e182b7-8028-4030-9e7e-fcec0712037c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample