./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme --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 eec124b30114ac40ce6b503b76c1b377fc7c0cddd0ece3b04d579d49ce56e9b5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 12:04:40,978 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 12:04:41,091 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-26 12:04:41,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 12:04:41,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 12:04:41,130 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 12:04:41,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 12:04:41,131 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 12:04:41,133 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 12:04:41,138 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 12:04:41,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 12:04:41,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 12:04:41,141 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 12:04:41,142 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 12:04:41,143 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 12:04:41,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 12:04:41,144 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 12:04:41,144 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 12:04:41,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 12:04:41,146 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 12:04:41,147 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 12:04:41,148 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 12:04:41,148 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 12:04:41,149 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 12:04:41,149 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 12:04:41,149 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 12:04:41,150 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 12:04:41,150 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 12:04:41,151 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 12:04:41,152 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 12:04:41,153 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 12:04:41,154 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 12:04:41,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:04:41,154 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 12:04:41,154 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 12:04:41,155 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 12:04:41,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 12:04:41,178 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 12:04:41,178 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 12:04:41,178 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 12:04:41,178 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 12:04:41,180 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_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme/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_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme 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 -> eec124b30114ac40ce6b503b76c1b377fc7c0cddd0ece3b04d579d49ce56e9b5 [2023-11-26 12:04:41,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 12:04:41,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 12:04:41,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 12:04:41,562 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 12:04:41,562 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 12:04:41,564 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2023-11-26 12:04:44,647 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 12:04:44,956 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 12:04:44,957 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2023-11-26 12:04:44,976 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme/data/4924a5a4a/d918c31cdecf46ec8cc58aa35aab9c89/FLAGb1f647b94 [2023-11-26 12:04:44,992 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme/data/4924a5a4a/d918c31cdecf46ec8cc58aa35aab9c89 [2023-11-26 12:04:44,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 12:04:44,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 12:04:45,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 12:04:45,009 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 12:04:45,020 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 12:04:45,021 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:04:44" (1/1) ... [2023-11-26 12:04:45,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56b2d160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:45, skipping insertion in model container [2023-11-26 12:04:45,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:04:44" (1/1) ... [2023-11-26 12:04:45,075 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 12:04:45,665 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:04:45,684 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 12:04:45,768 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:04:45,817 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 12:04:45,817 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 12:04:45,825 INFO L206 MainTranslator]: Completed translation [2023-11-26 12:04:45,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:45 WrapperNode [2023-11-26 12:04:45,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 12:04:45,828 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 12:04:45,828 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 12:04:45,829 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 12:04:45,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:45" (1/1) ... [2023-11-26 12:04:45,877 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:45" (1/1) ... [2023-11-26 12:04:45,942 INFO L138 Inliner]: procedures = 175, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 169 [2023-11-26 12:04:45,943 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 12:04:45,943 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 12:04:45,943 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 12:04:45,944 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 12:04:45,958 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:45" (1/1) ... [2023-11-26 12:04:45,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:45" (1/1) ... [2023-11-26 12:04:45,970 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:45" (1/1) ... [2023-11-26 12:04:46,016 INFO L175 MemorySlicer]: Split 20 memory accesses to 4 slices as follows [2, 1, 16, 1]. 80 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1, 0]. The 7 writes are split as follows [0, 1, 5, 1]. [2023-11-26 12:04:46,016 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:45" (1/1) ... [2023-11-26 12:04:46,017 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:45" (1/1) ... [2023-11-26 12:04:46,044 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:45" (1/1) ... [2023-11-26 12:04:46,047 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:45" (1/1) ... [2023-11-26 12:04:46,050 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:45" (1/1) ... [2023-11-26 12:04:46,053 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:45" (1/1) ... [2023-11-26 12:04:46,058 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 12:04:46,059 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 12:04:46,059 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 12:04:46,059 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 12:04:46,060 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:45" (1/1) ... [2023-11-26 12:04:46,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:04:46,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:04:46,153 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 12:04:46,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 12:04:46,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-26 12:04:46,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-26 12:04:46,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-26 12:04:46,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-26 12:04:46,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 12:04:46,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 12:04:46,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 12:04:46,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-26 12:04:46,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 12:04:46,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 12:04:46,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 12:04:46,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 12:04:46,273 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-26 12:04:46,273 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-26 12:04:46,274 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-26 12:04:46,274 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-26 12:04:46,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 12:04:46,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 12:04:46,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 12:04:46,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-26 12:04:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 12:04:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 12:04:46,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 12:04:46,278 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 12:04:46,480 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 12:04:46,483 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 12:04:47,063 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 12:04:47,591 WARN L1821 r$LargeBlockEncoding]: Complex 4:9 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2023-11-26 12:04:47,734 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 12:04:47,734 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 12:04:47,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:04:47 BoogieIcfgContainer [2023-11-26 12:04:47,736 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 12:04:47,740 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 12:04:47,741 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 12:04:47,746 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 12:04:47,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:04:44" (1/3) ... [2023-11-26 12:04:47,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@357b6e8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:04:47, skipping insertion in model container [2023-11-26 12:04:47,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:45" (2/3) ... [2023-11-26 12:04:47,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@357b6e8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:04:47, skipping insertion in model container [2023-11-26 12:04:47,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:04:47" (3/3) ... [2023-11-26 12:04:47,751 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.opt-thin000_power.opt.i [2023-11-26 12:04:47,772 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 12:04:47,772 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2023-11-26 12:04:47,772 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 12:04:48,006 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 12:04:48,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 98 transitions, 204 flow [2023-11-26 12:04:48,110 INFO L124 PetriNetUnfolderBase]: 29/96 cut-off events. [2023-11-26 12:04:48,110 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 12:04:48,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 96 events. 29/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 293 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 93. Up to 4 conditions per place. [2023-11-26 12:04:48,115 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 98 transitions, 204 flow [2023-11-26 12:04:48,122 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 96 transitions, 198 flow [2023-11-26 12:04:48,132 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 12:04:48,139 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;@69340eef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 12:04:48,139 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2023-11-26 12:04:48,143 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 12:04:48,143 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-26 12:04:48,143 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 12:04:48,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:48,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 12:04:48,145 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-26 12:04:48,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:48,150 INFO L85 PathProgramCache]: Analyzing trace with hash 24987, now seen corresponding path program 1 times [2023-11-26 12:04:48,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:48,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428691583] [2023-11-26 12:04:48,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:48,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:48,517 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-26 12:04:48,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:48,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428691583] [2023-11-26 12:04:48,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428691583] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:48,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:48,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 12:04:48,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671555599] [2023-11-26 12:04:48,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:48,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:04:48,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:48,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:04:48,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:04:48,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 98 [2023-11-26 12:04:48,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 96 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:48,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:48,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 98 [2023-11-26 12:04:48,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:50,314 INFO L124 PetriNetUnfolderBase]: 2747/4560 cut-off events. [2023-11-26 12:04:50,314 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-11-26 12:04:50,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8701 conditions, 4560 events. 2747/4560 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 33290 event pairs, 2020 based on Foata normal form. 180/2149 useless extension candidates. Maximal degree in co-relation 8688. Up to 3561 conditions per place. [2023-11-26 12:04:50,366 INFO L140 encePairwiseOnDemand]: 55/98 looper letters, 57 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2023-11-26 12:04:50,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 74 transitions, 272 flow [2023-11-26 12:04:50,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:04:50,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:04:50,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2023-11-26 12:04:50,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2023-11-26 12:04:50,384 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 189 transitions. [2023-11-26 12:04:50,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 189 transitions. [2023-11-26 12:04:50,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:50,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 189 transitions. [2023-11-26 12:04:50,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:50,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:50,403 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:50,405 INFO L175 Difference]: Start difference. First operand has 74 places, 96 transitions, 198 flow. Second operand 3 states and 189 transitions. [2023-11-26 12:04:50,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 74 transitions, 272 flow [2023-11-26 12:04:50,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 74 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:04:50,417 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 116 flow [2023-11-26 12:04:50,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2023-11-26 12:04:50,425 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -16 predicate places. [2023-11-26 12:04:50,425 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 116 flow [2023-11-26 12:04:50,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:50,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:50,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 12:04:50,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 12:04:50,427 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-26 12:04:50,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:50,427 INFO L85 PathProgramCache]: Analyzing trace with hash 24988, now seen corresponding path program 1 times [2023-11-26 12:04:50,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:50,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965994834] [2023-11-26 12:04:50,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:50,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:50,572 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-26 12:04:50,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:50,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965994834] [2023-11-26 12:04:50,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965994834] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:50,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:50,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 12:04:50,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048496116] [2023-11-26 12:04:50,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:50,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:04:50,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:50,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:04:50,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:04:50,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 98 [2023-11-26 12:04:50,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:50,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:50,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 98 [2023-11-26 12:04:50,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:51,841 INFO L124 PetriNetUnfolderBase]: 2747/4559 cut-off events. [2023-11-26 12:04:51,842 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-11-26 12:04:51,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8789 conditions, 4559 events. 2747/4559 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 33250 event pairs, 2020 based on Foata normal form. 1/1969 useless extension candidates. Maximal degree in co-relation 8778. Up to 3560 conditions per place. [2023-11-26 12:04:51,893 INFO L140 encePairwiseOnDemand]: 95/98 looper letters, 56 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2023-11-26 12:04:51,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 73 transitions, 270 flow [2023-11-26 12:04:51,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:04:51,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:04:51,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-26 12:04:51,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3843537414965986 [2023-11-26 12:04:51,896 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-26 12:04:51,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-26 12:04:51,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:51,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-26 12:04:51,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:51,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:51,900 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:51,900 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 116 flow. Second operand 3 states and 113 transitions. [2023-11-26 12:04:51,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 73 transitions, 270 flow [2023-11-26 12:04:51,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 73 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:04:51,910 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 114 flow [2023-11-26 12:04:51,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2023-11-26 12:04:51,911 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -17 predicate places. [2023-11-26 12:04:51,911 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 114 flow [2023-11-26 12:04:51,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:51,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:51,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 12:04:51,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 12:04:51,913 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-26 12:04:51,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:51,914 INFO L85 PathProgramCache]: Analyzing trace with hash 745246956, now seen corresponding path program 1 times [2023-11-26 12:04:51,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:51,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557761115] [2023-11-26 12:04:51,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:51,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:51,983 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-26 12:04:51,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:51,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557761115] [2023-11-26 12:04:51,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557761115] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:51,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:51,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:04:51,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788759060] [2023-11-26 12:04:51,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:51,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:04:51,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:51,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:04:51,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:04:51,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 98 [2023-11-26 12:04:51,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:51,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:52,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 98 [2023-11-26 12:04:52,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:53,141 INFO L124 PetriNetUnfolderBase]: 2755/4573 cut-off events. [2023-11-26 12:04:53,141 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-11-26 12:04:53,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8820 conditions, 4573 events. 2755/4573 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 33315 event pairs, 1132 based on Foata normal form. 0/2025 useless extension candidates. Maximal degree in co-relation 8809. Up to 3567 conditions per place. [2023-11-26 12:04:53,192 INFO L140 encePairwiseOnDemand]: 95/98 looper letters, 57 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2023-11-26 12:04:53,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 72 transitions, 270 flow [2023-11-26 12:04:53,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:04:53,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:04:53,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2023-11-26 12:04:53,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37755102040816324 [2023-11-26 12:04:53,197 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 111 transitions. [2023-11-26 12:04:53,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 111 transitions. [2023-11-26 12:04:53,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:53,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 111 transitions. [2023-11-26 12:04:53,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.0) internal successors, (111), 3 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-26 12:04:53,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:53,203 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:53,203 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 114 flow. Second operand 3 states and 111 transitions. [2023-11-26 12:04:53,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 72 transitions, 270 flow [2023-11-26 12:04:53,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 72 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:04:53,214 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 112 flow [2023-11-26 12:04:53,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=54, 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=112, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2023-11-26 12:04:53,216 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -18 predicate places. [2023-11-26 12:04:53,217 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 112 flow [2023-11-26 12:04:53,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:53,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:53,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 12:04:53,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 12:04:53,218 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-26 12:04:53,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:53,220 INFO L85 PathProgramCache]: Analyzing trace with hash 745246957, now seen corresponding path program 1 times [2023-11-26 12:04:53,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:53,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391421902] [2023-11-26 12:04:53,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:53,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:53,362 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-26 12:04:53,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:53,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391421902] [2023-11-26 12:04:53,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391421902] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:53,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:53,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:04:53,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388465298] [2023-11-26 12:04:53,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:53,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:04:53,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:53,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:04:53,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:04:53,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 98 [2023-11-26 12:04:53,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:53,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:53,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 98 [2023-11-26 12:04:53,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:54,556 INFO L124 PetriNetUnfolderBase]: 2747/4556 cut-off events. [2023-11-26 12:04:54,556 INFO L125 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2023-11-26 12:04:54,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8794 conditions, 4556 events. 2747/4556 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 33170 event pairs, 1132 based on Foata normal form. 9/2023 useless extension candidates. Maximal degree in co-relation 8784. Up to 3550 conditions per place. [2023-11-26 12:04:54,596 INFO L140 encePairwiseOnDemand]: 95/98 looper letters, 56 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2023-11-26 12:04:54,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 71 transitions, 266 flow [2023-11-26 12:04:54,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:04:54,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:04:54,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-26 12:04:54,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3843537414965986 [2023-11-26 12:04:54,598 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-26 12:04:54,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-26 12:04:54,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:54,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-26 12:04:54,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:54,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:54,602 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:54,602 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 112 flow. Second operand 3 states and 113 transitions. [2023-11-26 12:04:54,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 71 transitions, 266 flow [2023-11-26 12:04:54,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 71 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:04:54,606 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 110 flow [2023-11-26 12:04:54,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=53, 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=110, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2023-11-26 12:04:54,608 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -19 predicate places. [2023-11-26 12:04:54,608 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 110 flow [2023-11-26 12:04:54,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:54,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:54,609 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-26 12:04:54,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 12:04:54,609 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-26 12:04:54,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:54,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1627900314, now seen corresponding path program 1 times [2023-11-26 12:04:54,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:54,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013896558] [2023-11-26 12:04:54,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:54,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:54,715 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-26 12:04:54,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:54,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013896558] [2023-11-26 12:04:54,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013896558] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:54,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:54,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 12:04:54,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669277273] [2023-11-26 12:04:54,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:54,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:04:54,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:54,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:04:54,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:04:54,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 98 [2023-11-26 12:04:54,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:54,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:54,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 98 [2023-11-26 12:04:54,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:56,022 INFO L124 PetriNetUnfolderBase]: 3591/6011 cut-off events. [2023-11-26 12:04:56,023 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2023-11-26 12:04:56,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11712 conditions, 6011 events. 3591/6011 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 48177 event pairs, 812 based on Foata normal form. 0/2736 useless extension candidates. Maximal degree in co-relation 11702. Up to 3214 conditions per place. [2023-11-26 12:04:56,112 INFO L140 encePairwiseOnDemand]: 91/98 looper letters, 65 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2023-11-26 12:04:56,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 81 transitions, 312 flow [2023-11-26 12:04:56,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:04:56,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:04:56,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2023-11-26 12:04:56,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4387755102040816 [2023-11-26 12:04:56,117 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 129 transitions. [2023-11-26 12:04:56,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 129 transitions. [2023-11-26 12:04:56,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:56,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 129 transitions. [2023-11-26 12:04:56,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:56,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:56,123 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:56,123 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 110 flow. Second operand 3 states and 129 transitions. [2023-11-26 12:04:56,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 81 transitions, 312 flow [2023-11-26 12:04:56,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 81 transitions, 304 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:04:56,131 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 126 flow [2023-11-26 12:04:56,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2023-11-26 12:04:56,132 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -18 predicate places. [2023-11-26 12:04:56,132 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 126 flow [2023-11-26 12:04:56,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:56,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:56,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:04:56,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 12:04:56,133 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-26 12:04:56,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:56,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1074696947, now seen corresponding path program 1 times [2023-11-26 12:04:56,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:56,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484103323] [2023-11-26 12:04:56,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:56,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:56,291 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-26 12:04:56,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:56,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484103323] [2023-11-26 12:04:56,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484103323] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:56,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:56,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:04:56,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841271840] [2023-11-26 12:04:56,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:56,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:04:56,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:56,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:04:56,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:04:56,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 98 [2023-11-26 12:04:56,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:56,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:56,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 98 [2023-11-26 12:04:56,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:57,811 INFO L124 PetriNetUnfolderBase]: 3732/6414 cut-off events. [2023-11-26 12:04:57,812 INFO L125 PetriNetUnfolderBase]: For 869/869 co-relation queries the response was YES. [2023-11-26 12:04:57,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13018 conditions, 6414 events. 3732/6414 cut-off events. For 869/869 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 51524 event pairs, 2036 based on Foata normal form. 45/3332 useless extension candidates. Maximal degree in co-relation 13005. Up to 4614 conditions per place. [2023-11-26 12:04:57,859 INFO L140 encePairwiseOnDemand]: 88/98 looper letters, 61 selfloop transitions, 7 changer transitions 0/81 dead transitions. [2023-11-26 12:04:57,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 81 transitions, 330 flow [2023-11-26 12:04:57,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:04:57,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:04:57,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2023-11-26 12:04:57,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43197278911564624 [2023-11-26 12:04:57,861 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 127 transitions. [2023-11-26 12:04:57,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 127 transitions. [2023-11-26 12:04:57,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:57,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 127 transitions. [2023-11-26 12:04:57,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:57,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:57,864 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:57,864 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 126 flow. Second operand 3 states and 127 transitions. [2023-11-26 12:04:57,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 81 transitions, 330 flow [2023-11-26 12:04:57,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 81 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:04:57,870 INFO L231 Difference]: Finished difference. Result has 57 places, 57 transitions, 177 flow [2023-11-26 12:04:57,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=57, PETRI_TRANSITIONS=57} [2023-11-26 12:04:57,874 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -17 predicate places. [2023-11-26 12:04:57,874 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 57 transitions, 177 flow [2023-11-26 12:04:57,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:57,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:57,876 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:04:57,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 12:04:57,876 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-26 12:04:57,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:57,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1074696946, now seen corresponding path program 1 times [2023-11-26 12:04:57,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:57,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926360875] [2023-11-26 12:04:57,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:57,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:58,030 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-26 12:04:58,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:58,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926360875] [2023-11-26 12:04:58,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926360875] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:58,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:58,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:04:58,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137556837] [2023-11-26 12:04:58,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:58,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:04:58,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:58,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:04:58,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:04:58,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 98 [2023-11-26 12:04:58,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 177 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:58,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:58,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 98 [2023-11-26 12:04:58,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:59,148 INFO L124 PetriNetUnfolderBase]: 2127/3922 cut-off events. [2023-11-26 12:04:59,148 INFO L125 PetriNetUnfolderBase]: For 1259/1259 co-relation queries the response was YES. [2023-11-26 12:04:59,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9186 conditions, 3922 events. 2127/3922 cut-off events. For 1259/1259 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 30130 event pairs, 1207 based on Foata normal form. 0/2896 useless extension candidates. Maximal degree in co-relation 9172. Up to 2202 conditions per place. [2023-11-26 12:04:59,172 INFO L140 encePairwiseOnDemand]: 83/98 looper letters, 66 selfloop transitions, 14 changer transitions 0/92 dead transitions. [2023-11-26 12:04:59,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 92 transitions, 490 flow [2023-11-26 12:04:59,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 12:04:59,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 12:04:59,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2023-11-26 12:04:59,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38010204081632654 [2023-11-26 12:04:59,176 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 149 transitions. [2023-11-26 12:04:59,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 149 transitions. [2023-11-26 12:04:59,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:59,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 149 transitions. [2023-11-26 12:04:59,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:59,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:59,179 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:59,179 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 177 flow. Second operand 4 states and 149 transitions. [2023-11-26 12:04:59,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 92 transitions, 490 flow [2023-11-26 12:04:59,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 462 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-11-26 12:04:59,186 INFO L231 Difference]: Finished difference. Result has 60 places, 67 transitions, 316 flow [2023-11-26 12:04:59,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=316, PETRI_PLACES=60, PETRI_TRANSITIONS=67} [2023-11-26 12:04:59,187 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -14 predicate places. [2023-11-26 12:04:59,188 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 67 transitions, 316 flow [2023-11-26 12:04:59,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:59,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:59,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:04:59,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 12:04:59,189 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-26 12:04:59,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:59,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1074696945, now seen corresponding path program 1 times [2023-11-26 12:04:59,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:59,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031299908] [2023-11-26 12:04:59,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:59,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:59,310 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-26 12:04:59,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:59,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031299908] [2023-11-26 12:04:59,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031299908] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:59,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:59,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 12:04:59,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594326763] [2023-11-26 12:04:59,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:59,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:04:59,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:59,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:04:59,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:04:59,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 98 [2023-11-26 12:04:59,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 67 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:59,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:59,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 98 [2023-11-26 12:04:59,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:59,709 INFO L124 PetriNetUnfolderBase]: 758/1496 cut-off events. [2023-11-26 12:04:59,709 INFO L125 PetriNetUnfolderBase]: For 1490/1490 co-relation queries the response was YES. [2023-11-26 12:04:59,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4475 conditions, 1496 events. 758/1496 cut-off events. For 1490/1490 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 10030 event pairs, 481 based on Foata normal form. 434/1686 useless extension candidates. Maximal degree in co-relation 4458. Up to 1274 conditions per place. [2023-11-26 12:04:59,721 INFO L140 encePairwiseOnDemand]: 90/98 looper letters, 46 selfloop transitions, 1 changer transitions 0/60 dead transitions. [2023-11-26 12:04:59,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 60 transitions, 394 flow [2023-11-26 12:04:59,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:04:59,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:04:59,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2023-11-26 12:04:59,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3129251700680272 [2023-11-26 12:04:59,723 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 92 transitions. [2023-11-26 12:04:59,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 92 transitions. [2023-11-26 12:04:59,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:59,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 92 transitions. [2023-11-26 12:04:59,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:59,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:59,726 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:59,726 INFO L175 Difference]: Start difference. First operand has 60 places, 67 transitions, 316 flow. Second operand 3 states and 92 transitions. [2023-11-26 12:04:59,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 60 transitions, 394 flow [2023-11-26 12:04:59,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 60 transitions, 392 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 12:04:59,730 INFO L231 Difference]: Finished difference. Result has 54 places, 60 transitions, 300 flow [2023-11-26 12:04:59,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=54, PETRI_TRANSITIONS=60} [2023-11-26 12:04:59,731 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -20 predicate places. [2023-11-26 12:04:59,731 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 60 transitions, 300 flow [2023-11-26 12:04:59,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:59,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:59,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:04:59,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 12:04:59,733 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-26 12:04:59,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:59,733 INFO L85 PathProgramCache]: Analyzing trace with hash 781513312, now seen corresponding path program 1 times [2023-11-26 12:04:59,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:59,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824438413] [2023-11-26 12:04:59,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:59,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:59,820 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-26 12:04:59,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:59,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824438413] [2023-11-26 12:04:59,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824438413] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:59,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:59,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 12:04:59,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097879146] [2023-11-26 12:04:59,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:59,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:04:59,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:59,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:04:59,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:04:59,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 98 [2023-11-26 12:04:59,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 60 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:04:59,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:59,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 98 [2023-11-26 12:04:59,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:00,223 INFO L124 PetriNetUnfolderBase]: 718/1429 cut-off events. [2023-11-26 12:05:00,224 INFO L125 PetriNetUnfolderBase]: For 1190/1190 co-relation queries the response was YES. [2023-11-26 12:05:00,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4259 conditions, 1429 events. 718/1429 cut-off events. For 1190/1190 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 9343 event pairs, 208 based on Foata normal form. 0/1233 useless extension candidates. Maximal degree in co-relation 4246. Up to 1084 conditions per place. [2023-11-26 12:05:00,236 INFO L140 encePairwiseOnDemand]: 91/98 looper letters, 47 selfloop transitions, 17 changer transitions 0/77 dead transitions. [2023-11-26 12:05:00,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 77 transitions, 503 flow [2023-11-26 12:05:00,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:05:00,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:05:00,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2023-11-26 12:05:00,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3401360544217687 [2023-11-26 12:05:00,238 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 100 transitions. [2023-11-26 12:05:00,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 100 transitions. [2023-11-26 12:05:00,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:00,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 100 transitions. [2023-11-26 12:05:00,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:00,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:00,241 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:00,241 INFO L175 Difference]: Start difference. First operand has 54 places, 60 transitions, 300 flow. Second operand 3 states and 100 transitions. [2023-11-26 12:05:00,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 77 transitions, 503 flow [2023-11-26 12:05:00,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 77 transitions, 502 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 12:05:00,246 INFO L231 Difference]: Finished difference. Result has 56 places, 60 transitions, 354 flow [2023-11-26 12:05:00,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=354, PETRI_PLACES=56, PETRI_TRANSITIONS=60} [2023-11-26 12:05:00,247 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -18 predicate places. [2023-11-26 12:05:00,247 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 60 transitions, 354 flow [2023-11-26 12:05:00,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:00,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:00,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:05:00,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 12:05:00,248 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-26 12:05:00,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:00,249 INFO L85 PathProgramCache]: Analyzing trace with hash -584866129, now seen corresponding path program 1 times [2023-11-26 12:05:00,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:00,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353997920] [2023-11-26 12:05:00,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:00,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:00,476 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-26 12:05:00,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:00,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353997920] [2023-11-26 12:05:00,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353997920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:00,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:00,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 12:05:00,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803829127] [2023-11-26 12:05:00,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:00,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:05:00,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:00,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:05:00,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:05:00,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 98 [2023-11-26 12:05:00,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 60 transitions, 354 flow. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:00,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:00,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 98 [2023-11-26 12:05:00,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:00,889 INFO L124 PetriNetUnfolderBase]: 684/1371 cut-off events. [2023-11-26 12:05:00,889 INFO L125 PetriNetUnfolderBase]: For 1324/1324 co-relation queries the response was YES. [2023-11-26 12:05:00,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4469 conditions, 1371 events. 684/1371 cut-off events. For 1324/1324 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 8878 event pairs, 190 based on Foata normal form. 0/1223 useless extension candidates. Maximal degree in co-relation 4454. Up to 1025 conditions per place. [2023-11-26 12:05:00,901 INFO L140 encePairwiseOnDemand]: 92/98 looper letters, 46 selfloop transitions, 17 changer transitions 0/76 dead transitions. [2023-11-26 12:05:00,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 76 transitions, 551 flow [2023-11-26 12:05:00,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 12:05:00,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 12:05:00,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2023-11-26 12:05:00,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29846938775510207 [2023-11-26 12:05:00,904 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 117 transitions. [2023-11-26 12:05:00,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 117 transitions. [2023-11-26 12:05:00,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:00,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 117 transitions. [2023-11-26 12:05:00,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 29.25) internal successors, (117), 4 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-26 12:05:00,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:00,906 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:00,907 INFO L175 Difference]: Start difference. First operand has 56 places, 60 transitions, 354 flow. Second operand 4 states and 117 transitions. [2023-11-26 12:05:00,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 76 transitions, 551 flow [2023-11-26 12:05:00,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 76 transitions, 517 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:05:00,912 INFO L231 Difference]: Finished difference. Result has 56 places, 59 transitions, 350 flow [2023-11-26 12:05:00,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=350, PETRI_PLACES=56, PETRI_TRANSITIONS=59} [2023-11-26 12:05:00,913 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -18 predicate places. [2023-11-26 12:05:00,913 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 59 transitions, 350 flow [2023-11-26 12:05:00,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:00,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:00,914 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:05:00,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 12:05:00,914 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-26 12:05:00,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:00,915 INFO L85 PathProgramCache]: Analyzing trace with hash 630678200, now seen corresponding path program 1 times [2023-11-26 12:05:00,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:00,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647767437] [2023-11-26 12:05:00,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:00,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:00,997 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-26 12:05:00,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:00,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647767437] [2023-11-26 12:05:00,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647767437] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:00,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:00,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 12:05:00,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227661550] [2023-11-26 12:05:00,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:00,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:05:00,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:01,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:05:01,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:05:01,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 98 [2023-11-26 12:05:01,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 59 transitions, 350 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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-26 12:05:01,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:01,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 98 [2023-11-26 12:05:01,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:01,421 INFO L124 PetriNetUnfolderBase]: 682/1428 cut-off events. [2023-11-26 12:05:01,421 INFO L125 PetriNetUnfolderBase]: For 1288/1288 co-relation queries the response was YES. [2023-11-26 12:05:01,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4540 conditions, 1428 events. 682/1428 cut-off events. For 1288/1288 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 9635 event pairs, 120 based on Foata normal form. 24/1304 useless extension candidates. Maximal degree in co-relation 4525. Up to 648 conditions per place. [2023-11-26 12:05:01,432 INFO L140 encePairwiseOnDemand]: 89/98 looper letters, 41 selfloop transitions, 23 changer transitions 0/77 dead transitions. [2023-11-26 12:05:01,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 77 transitions, 539 flow [2023-11-26 12:05:01,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 12:05:01,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 12:05:01,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2023-11-26 12:05:01,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32142857142857145 [2023-11-26 12:05:01,434 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 126 transitions. [2023-11-26 12:05:01,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 126 transitions. [2023-11-26 12:05:01,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:01,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 126 transitions. [2023-11-26 12:05:01,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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-26 12:05:01,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:01,437 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:01,438 INFO L175 Difference]: Start difference. First operand has 56 places, 59 transitions, 350 flow. Second operand 4 states and 126 transitions. [2023-11-26 12:05:01,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 77 transitions, 539 flow [2023-11-26 12:05:01,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 77 transitions, 504 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-26 12:05:01,442 INFO L231 Difference]: Finished difference. Result has 55 places, 59 transitions, 362 flow [2023-11-26 12:05:01,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=362, PETRI_PLACES=55, PETRI_TRANSITIONS=59} [2023-11-26 12:05:01,443 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -19 predicate places. [2023-11-26 12:05:01,443 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 59 transitions, 362 flow [2023-11-26 12:05:01,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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-26 12:05:01,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:01,444 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:05:01,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 12:05:01,444 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-26 12:05:01,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:01,445 INFO L85 PathProgramCache]: Analyzing trace with hash 494934861, now seen corresponding path program 1 times [2023-11-26 12:05:01,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:01,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743209051] [2023-11-26 12:05:01,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:01,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:01,734 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-26 12:05:01,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:01,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743209051] [2023-11-26 12:05:01,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743209051] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:01,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:01,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:05:01,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848840454] [2023-11-26 12:05:01,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:01,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:05:01,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:01,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:05:01,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:05:01,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 98 [2023-11-26 12:05:01,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 59 transitions, 362 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:01,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:01,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 98 [2023-11-26 12:05:01,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:02,268 INFO L124 PetriNetUnfolderBase]: 682/1416 cut-off events. [2023-11-26 12:05:02,268 INFO L125 PetriNetUnfolderBase]: For 1568/1568 co-relation queries the response was YES. [2023-11-26 12:05:02,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4621 conditions, 1416 events. 682/1416 cut-off events. For 1568/1568 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 9641 event pairs, 362 based on Foata normal form. 0/1261 useless extension candidates. Maximal degree in co-relation 4607. Up to 670 conditions per place. [2023-11-26 12:05:02,279 INFO L140 encePairwiseOnDemand]: 94/98 looper letters, 49 selfloop transitions, 4 changer transitions 8/72 dead transitions. [2023-11-26 12:05:02,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 72 transitions, 574 flow [2023-11-26 12:05:02,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 12:05:02,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 12:05:02,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2023-11-26 12:05:02,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24489795918367346 [2023-11-26 12:05:02,282 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 120 transitions. [2023-11-26 12:05:02,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 120 transitions. [2023-11-26 12:05:02,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:02,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 120 transitions. [2023-11-26 12:05:02,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:02,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:02,285 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:02,285 INFO L175 Difference]: Start difference. First operand has 55 places, 59 transitions, 362 flow. Second operand 5 states and 120 transitions. [2023-11-26 12:05:02,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 72 transitions, 574 flow [2023-11-26 12:05:02,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 72 transitions, 559 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 12:05:02,289 INFO L231 Difference]: Finished difference. Result has 57 places, 57 transitions, 343 flow [2023-11-26 12:05:02,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=343, PETRI_PLACES=57, PETRI_TRANSITIONS=57} [2023-11-26 12:05:02,292 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -17 predicate places. [2023-11-26 12:05:02,292 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 57 transitions, 343 flow [2023-11-26 12:05:02,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:02,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:02,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:05:02,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 12:05:02,295 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-26 12:05:02,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:02,295 INFO L85 PathProgramCache]: Analyzing trace with hash 494935936, now seen corresponding path program 1 times [2023-11-26 12:05:02,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:02,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829406947] [2023-11-26 12:05:02,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:02,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:02,559 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-26 12:05:02,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:02,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829406947] [2023-11-26 12:05:02,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829406947] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:02,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:02,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:05:02,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477925625] [2023-11-26 12:05:02,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:02,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:05:02,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:02,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:05:02,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:05:02,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 98 [2023-11-26 12:05:02,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 343 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:02,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:02,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 98 [2023-11-26 12:05:02,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:03,315 INFO L124 PetriNetUnfolderBase]: 1142/2277 cut-off events. [2023-11-26 12:05:03,315 INFO L125 PetriNetUnfolderBase]: For 2139/2139 co-relation queries the response was YES. [2023-11-26 12:05:03,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7496 conditions, 2277 events. 1142/2277 cut-off events. For 2139/2139 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 16588 event pairs, 418 based on Foata normal form. 0/2009 useless extension candidates. Maximal degree in co-relation 7481. Up to 1185 conditions per place. [2023-11-26 12:05:03,331 INFO L140 encePairwiseOnDemand]: 91/98 looper letters, 120 selfloop transitions, 14 changer transitions 5/149 dead transitions. [2023-11-26 12:05:03,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 149 transitions, 1253 flow [2023-11-26 12:05:03,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 12:05:03,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 12:05:03,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 226 transitions. [2023-11-26 12:05:03,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.288265306122449 [2023-11-26 12:05:03,335 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 226 transitions. [2023-11-26 12:05:03,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 226 transitions. [2023-11-26 12:05:03,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:03,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 226 transitions. [2023-11-26 12:05:03,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 28.25) internal successors, (226), 8 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:03,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 98.0) internal successors, (882), 9 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:03,340 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 98.0) internal successors, (882), 9 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:03,340 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 343 flow. Second operand 8 states and 226 transitions. [2023-11-26 12:05:03,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 149 transitions, 1253 flow [2023-11-26 12:05:03,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 149 transitions, 1241 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-26 12:05:03,349 INFO L231 Difference]: Finished difference. Result has 65 places, 67 transitions, 431 flow [2023-11-26 12:05:03,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=431, PETRI_PLACES=65, PETRI_TRANSITIONS=67} [2023-11-26 12:05:03,350 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -9 predicate places. [2023-11-26 12:05:03,350 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 67 transitions, 431 flow [2023-11-26 12:05:03,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:03,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:03,351 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:05:03,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 12:05:03,351 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-26 12:05:03,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:03,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1836887150, now seen corresponding path program 1 times [2023-11-26 12:05:03,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:03,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453935349] [2023-11-26 12:05:03,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:03,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:03,594 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-26 12:05:03,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:03,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453935349] [2023-11-26 12:05:03,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453935349] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:03,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:03,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:05:03,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114554096] [2023-11-26 12:05:03,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:03,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:05:03,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:03,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:05:03,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:05:03,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 98 [2023-11-26 12:05:03,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 67 transitions, 431 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 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-26 12:05:03,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:03,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 98 [2023-11-26 12:05:03,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:04,095 INFO L124 PetriNetUnfolderBase]: 734/1494 cut-off events. [2023-11-26 12:05:04,095 INFO L125 PetriNetUnfolderBase]: For 1921/1921 co-relation queries the response was YES. [2023-11-26 12:05:04,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5150 conditions, 1494 events. 734/1494 cut-off events. For 1921/1921 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 9880 event pairs, 303 based on Foata normal form. 104/1437 useless extension candidates. Maximal degree in co-relation 5131. Up to 642 conditions per place. [2023-11-26 12:05:04,106 INFO L140 encePairwiseOnDemand]: 90/98 looper letters, 27 selfloop transitions, 2 changer transitions 34/75 dead transitions. [2023-11-26 12:05:04,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 75 transitions, 605 flow [2023-11-26 12:05:04,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 12:05:04,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 12:05:04,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2023-11-26 12:05:04,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2612244897959184 [2023-11-26 12:05:04,109 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 128 transitions. [2023-11-26 12:05:04,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 128 transitions. [2023-11-26 12:05:04,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:04,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 128 transitions. [2023-11-26 12:05:04,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:04,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:04,112 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:04,112 INFO L175 Difference]: Start difference. First operand has 65 places, 67 transitions, 431 flow. Second operand 5 states and 128 transitions. [2023-11-26 12:05:04,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 75 transitions, 605 flow [2023-11-26 12:05:04,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 75 transitions, 587 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:05:04,121 INFO L231 Difference]: Finished difference. Result has 62 places, 38 transitions, 197 flow [2023-11-26 12:05:04,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=197, PETRI_PLACES=62, PETRI_TRANSITIONS=38} [2023-11-26 12:05:04,122 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -12 predicate places. [2023-11-26 12:05:04,122 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 38 transitions, 197 flow [2023-11-26 12:05:04,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 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-26 12:05:04,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:04,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:05:04,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 12:05:04,123 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-26 12:05:04,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:04,124 INFO L85 PathProgramCache]: Analyzing trace with hash 680074209, now seen corresponding path program 1 times [2023-11-26 12:05:04,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:04,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762403219] [2023-11-26 12:05:04,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:04,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:04,392 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-26 12:05:04,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:04,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762403219] [2023-11-26 12:05:04,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762403219] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:04,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:04,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:05:04,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782581076] [2023-11-26 12:05:04,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:04,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:05:04,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:04,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:05:04,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:05:04,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 98 [2023-11-26 12:05:04,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 38 transitions, 197 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:04,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:04,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 98 [2023-11-26 12:05:04,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:04,874 INFO L124 PetriNetUnfolderBase]: 438/888 cut-off events. [2023-11-26 12:05:04,874 INFO L125 PetriNetUnfolderBase]: For 923/923 co-relation queries the response was YES. [2023-11-26 12:05:04,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2848 conditions, 888 events. 438/888 cut-off events. For 923/923 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5095 event pairs, 75 based on Foata normal form. 29/845 useless extension candidates. Maximal degree in co-relation 2829. Up to 411 conditions per place. [2023-11-26 12:05:04,878 INFO L140 encePairwiseOnDemand]: 89/98 looper letters, 25 selfloop transitions, 9 changer transitions 51/96 dead transitions. [2023-11-26 12:05:04,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 96 transitions, 723 flow [2023-11-26 12:05:04,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 12:05:04,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 12:05:04,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 206 transitions. [2023-11-26 12:05:04,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2627551020408163 [2023-11-26 12:05:04,881 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 206 transitions. [2023-11-26 12:05:04,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 206 transitions. [2023-11-26 12:05:04,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:04,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 206 transitions. [2023-11-26 12:05:04,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 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-26 12:05:04,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 98.0) internal successors, (882), 9 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:04,884 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 98.0) internal successors, (882), 9 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:04,885 INFO L175 Difference]: Start difference. First operand has 62 places, 38 transitions, 197 flow. Second operand 8 states and 206 transitions. [2023-11-26 12:05:04,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 96 transitions, 723 flow [2023-11-26 12:05:04,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 96 transitions, 632 flow, removed 25 selfloop flow, removed 9 redundant places. [2023-11-26 12:05:04,890 INFO L231 Difference]: Finished difference. Result has 56 places, 37 transitions, 194 flow [2023-11-26 12:05:04,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=194, PETRI_PLACES=56, PETRI_TRANSITIONS=37} [2023-11-26 12:05:04,891 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -18 predicate places. [2023-11-26 12:05:04,891 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 37 transitions, 194 flow [2023-11-26 12:05:04,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:04,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:04,891 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-26 12:05:04,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 12:05:04,892 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-26 12:05:04,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:04,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1900368690, now seen corresponding path program 1 times [2023-11-26 12:05:04,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:04,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968140931] [2023-11-26 12:05:04,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:04,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:05,132 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-26 12:05:05,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:05,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968140931] [2023-11-26 12:05:05,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968140931] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:05,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:05,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:05:05,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11805580] [2023-11-26 12:05:05,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:05,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:05:05,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:05,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:05:05,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:05:05,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 98 [2023-11-26 12:05:05,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 37 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:05,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:05,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 98 [2023-11-26 12:05:05,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:05,599 INFO L124 PetriNetUnfolderBase]: 468/893 cut-off events. [2023-11-26 12:05:05,599 INFO L125 PetriNetUnfolderBase]: For 778/784 co-relation queries the response was YES. [2023-11-26 12:05:05,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2786 conditions, 893 events. 468/893 cut-off events. For 778/784 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4814 event pairs, 86 based on Foata normal form. 33/886 useless extension candidates. Maximal degree in co-relation 2769. Up to 287 conditions per place. [2023-11-26 12:05:05,602 INFO L140 encePairwiseOnDemand]: 92/98 looper letters, 26 selfloop transitions, 3 changer transitions 47/85 dead transitions. [2023-11-26 12:05:05,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 85 transitions, 545 flow [2023-11-26 12:05:05,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 12:05:05,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 12:05:05,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2023-11-26 12:05:05,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.23979591836734693 [2023-11-26 12:05:05,605 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 188 transitions. [2023-11-26 12:05:05,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 188 transitions. [2023-11-26 12:05:05,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:05,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 188 transitions. [2023-11-26 12:05:05,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 23.5) internal successors, (188), 8 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:05,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 98.0) internal successors, (882), 9 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:05,609 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 98.0) internal successors, (882), 9 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:05,609 INFO L175 Difference]: Start difference. First operand has 56 places, 37 transitions, 194 flow. Second operand 8 states and 188 transitions. [2023-11-26 12:05:05,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 85 transitions, 545 flow [2023-11-26 12:05:05,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 85 transitions, 511 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-26 12:05:05,615 INFO L231 Difference]: Finished difference. Result has 56 places, 30 transitions, 125 flow [2023-11-26 12:05:05,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=125, PETRI_PLACES=56, PETRI_TRANSITIONS=30} [2023-11-26 12:05:05,616 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -18 predicate places. [2023-11-26 12:05:05,616 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 30 transitions, 125 flow [2023-11-26 12:05:05,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:05,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:05,617 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-26 12:05:05,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 12:05:05,617 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-26 12:05:05,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:05,618 INFO L85 PathProgramCache]: Analyzing trace with hash 118336117, now seen corresponding path program 1 times [2023-11-26 12:05:05,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:05,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954590043] [2023-11-26 12:05:05,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:05,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:06,481 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-26 12:05:06,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:06,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954590043] [2023-11-26 12:05:06,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954590043] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:06,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:06,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 12:05:06,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157827037] [2023-11-26 12:05:06,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:06,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 12:05:06,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:06,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 12:05:06,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:05:06,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 98 [2023-11-26 12:05:06,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 30 transitions, 125 flow. Second operand has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 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-26 12:05:06,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:06,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 98 [2023-11-26 12:05:06,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:06,832 INFO L124 PetriNetUnfolderBase]: 167/369 cut-off events. [2023-11-26 12:05:06,832 INFO L125 PetriNetUnfolderBase]: For 456/468 co-relation queries the response was YES. [2023-11-26 12:05:06,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1110 conditions, 369 events. 167/369 cut-off events. For 456/468 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1726 event pairs, 61 based on Foata normal form. 16/384 useless extension candidates. Maximal degree in co-relation 1091. Up to 233 conditions per place. [2023-11-26 12:05:06,835 INFO L140 encePairwiseOnDemand]: 89/98 looper letters, 25 selfloop transitions, 10 changer transitions 16/62 dead transitions. [2023-11-26 12:05:06,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 62 transitions, 368 flow [2023-11-26 12:05:06,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 12:05:06,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 12:05:06,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions. [2023-11-26 12:05:06,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2478134110787172 [2023-11-26 12:05:06,838 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 170 transitions. [2023-11-26 12:05:06,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 170 transitions. [2023-11-26 12:05:06,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:06,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 170 transitions. [2023-11-26 12:05:06,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:06,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:06,842 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:06,842 INFO L175 Difference]: Start difference. First operand has 56 places, 30 transitions, 125 flow. Second operand 7 states and 170 transitions. [2023-11-26 12:05:06,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 62 transitions, 368 flow [2023-11-26 12:05:06,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 62 transitions, 313 flow, removed 16 selfloop flow, removed 11 redundant places. [2023-11-26 12:05:06,846 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 186 flow [2023-11-26 12:05:06,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=186, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2023-11-26 12:05:06,847 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -22 predicate places. [2023-11-26 12:05:06,847 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 186 flow [2023-11-26 12:05:06,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 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-26 12:05:06,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:06,848 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-26 12:05:06,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 12:05:06,848 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-26 12:05:06,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:06,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1492501365, now seen corresponding path program 2 times [2023-11-26 12:05:06,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:06,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243499518] [2023-11-26 12:05:06,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:06,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:07,770 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-26 12:05:07,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:07,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243499518] [2023-11-26 12:05:07,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243499518] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:07,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:07,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 12:05:07,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012817355] [2023-11-26 12:05:07,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:07,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 12:05:07,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:07,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 12:05:07,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-26 12:05:07,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 98 [2023-11-26 12:05:07,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 186 flow. Second operand has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 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-26 12:05:07,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:07,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 98 [2023-11-26 12:05:07,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:08,275 INFO L124 PetriNetUnfolderBase]: 141/315 cut-off events. [2023-11-26 12:05:08,275 INFO L125 PetriNetUnfolderBase]: For 341/374 co-relation queries the response was YES. [2023-11-26 12:05:08,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 315 events. 141/315 cut-off events. For 341/374 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1372 event pairs, 11 based on Foata normal form. 15/328 useless extension candidates. Maximal degree in co-relation 934. Up to 151 conditions per place. [2023-11-26 12:05:08,277 INFO L140 encePairwiseOnDemand]: 89/98 looper letters, 27 selfloop transitions, 11 changer transitions 25/74 dead transitions. [2023-11-26 12:05:08,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 74 transitions, 462 flow [2023-11-26 12:05:08,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-26 12:05:08,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-26 12:05:08,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 256 transitions. [2023-11-26 12:05:08,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.23747680890538034 [2023-11-26 12:05:08,280 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 256 transitions. [2023-11-26 12:05:08,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 256 transitions. [2023-11-26 12:05:08,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:08,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 256 transitions. [2023-11-26 12:05:08,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 23.272727272727273) internal successors, (256), 11 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:08,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 98.0) internal successors, (1176), 12 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:08,286 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 98.0) internal successors, (1176), 12 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:08,286 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 186 flow. Second operand 11 states and 256 transitions. [2023-11-26 12:05:08,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 74 transitions, 462 flow [2023-11-26 12:05:08,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 74 transitions, 442 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-11-26 12:05:08,290 INFO L231 Difference]: Finished difference. Result has 66 places, 39 transitions, 222 flow [2023-11-26 12:05:08,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=222, PETRI_PLACES=66, PETRI_TRANSITIONS=39} [2023-11-26 12:05:08,291 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -8 predicate places. [2023-11-26 12:05:08,292 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 39 transitions, 222 flow [2023-11-26 12:05:08,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 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-26 12:05:08,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:08,292 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-26 12:05:08,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-26 12:05:08,293 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-26 12:05:08,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:08,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1624356667, now seen corresponding path program 1 times [2023-11-26 12:05:08,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:08,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228641162] [2023-11-26 12:05:08,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:08,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:09,132 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-26 12:05:09,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:09,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228641162] [2023-11-26 12:05:09,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228641162] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:09,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:09,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 12:05:09,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719569931] [2023-11-26 12:05:09,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:09,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 12:05:09,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:09,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 12:05:09,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-26 12:05:09,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 98 [2023-11-26 12:05:09,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 39 transitions, 222 flow. Second operand has 8 states, 8 states have (on average 19.5) internal successors, (156), 8 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:09,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:09,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 98 [2023-11-26 12:05:09,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:09,509 INFO L124 PetriNetUnfolderBase]: 119/279 cut-off events. [2023-11-26 12:05:09,509 INFO L125 PetriNetUnfolderBase]: For 565/575 co-relation queries the response was YES. [2023-11-26 12:05:09,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 279 events. 119/279 cut-off events. For 565/575 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1178 event pairs, 41 based on Foata normal form. 15/292 useless extension candidates. Maximal degree in co-relation 936. Up to 177 conditions per place. [2023-11-26 12:05:09,512 INFO L140 encePairwiseOnDemand]: 89/98 looper letters, 28 selfloop transitions, 10 changer transitions 15/64 dead transitions. [2023-11-26 12:05:09,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 64 transitions, 464 flow [2023-11-26 12:05:09,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 12:05:09,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-26 12:05:09,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 209 transitions. [2023-11-26 12:05:09,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.23696145124716553 [2023-11-26 12:05:09,515 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 209 transitions. [2023-11-26 12:05:09,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 209 transitions. [2023-11-26 12:05:09,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:09,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 209 transitions. [2023-11-26 12:05:09,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 23.22222222222222) internal successors, (209), 9 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:09,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:09,520 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:09,520 INFO L175 Difference]: Start difference. First operand has 66 places, 39 transitions, 222 flow. Second operand 9 states and 209 transitions. [2023-11-26 12:05:09,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 64 transitions, 464 flow [2023-11-26 12:05:09,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 64 transitions, 414 flow, removed 12 selfloop flow, removed 10 redundant places. [2023-11-26 12:05:09,525 INFO L231 Difference]: Finished difference. Result has 63 places, 43 transitions, 269 flow [2023-11-26 12:05:09,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=269, PETRI_PLACES=63, PETRI_TRANSITIONS=43} [2023-11-26 12:05:09,526 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -11 predicate places. [2023-11-26 12:05:09,526 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 43 transitions, 269 flow [2023-11-26 12:05:09,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.5) internal successors, (156), 8 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:09,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:09,526 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] [2023-11-26 12:05:09,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-26 12:05:09,527 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-26 12:05:09,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:09,527 INFO L85 PathProgramCache]: Analyzing trace with hash 112570121, now seen corresponding path program 1 times [2023-11-26 12:05:09,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:09,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381235363] [2023-11-26 12:05:09,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:09,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:09,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:10,687 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-26 12:05:10,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:10,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381235363] [2023-11-26 12:05:10,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381235363] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:10,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:10,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 12:05:10,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341403034] [2023-11-26 12:05:10,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:10,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 12:05:10,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:10,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 12:05:10,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-26 12:05:10,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 98 [2023-11-26 12:05:10,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 43 transitions, 269 flow. Second operand has 9 states, 9 states have (on average 19.444444444444443) internal successors, (175), 9 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:10,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:10,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 98 [2023-11-26 12:05:10,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:11,023 INFO L124 PetriNetUnfolderBase]: 116/271 cut-off events. [2023-11-26 12:05:11,023 INFO L125 PetriNetUnfolderBase]: For 746/756 co-relation queries the response was YES. [2023-11-26 12:05:11,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1020 conditions, 271 events. 116/271 cut-off events. For 746/756 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1166 event pairs, 16 based on Foata normal form. 11/281 useless extension candidates. Maximal degree in co-relation 998. Up to 143 conditions per place. [2023-11-26 12:05:11,026 INFO L140 encePairwiseOnDemand]: 89/98 looper letters, 28 selfloop transitions, 21 changer transitions 8/68 dead transitions. [2023-11-26 12:05:11,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 68 transitions, 510 flow [2023-11-26 12:05:11,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 12:05:11,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-26 12:05:11,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 208 transitions. [2023-11-26 12:05:11,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.23582766439909297 [2023-11-26 12:05:11,030 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 208 transitions. [2023-11-26 12:05:11,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 208 transitions. [2023-11-26 12:05:11,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:11,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 208 transitions. [2023-11-26 12:05:11,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 23.11111111111111) internal successors, (208), 9 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:11,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:11,036 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:11,036 INFO L175 Difference]: Start difference. First operand has 63 places, 43 transitions, 269 flow. Second operand 9 states and 208 transitions. [2023-11-26 12:05:11,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 68 transitions, 510 flow [2023-11-26 12:05:11,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 68 transitions, 485 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-11-26 12:05:11,041 INFO L231 Difference]: Finished difference. Result has 67 places, 49 transitions, 381 flow [2023-11-26 12:05:11,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=381, PETRI_PLACES=67, PETRI_TRANSITIONS=49} [2023-11-26 12:05:11,042 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2023-11-26 12:05:11,042 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 49 transitions, 381 flow [2023-11-26 12:05:11,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.444444444444443) internal successors, (175), 9 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:11,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:11,043 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] [2023-11-26 12:05:11,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-26 12:05:11,043 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-26 12:05:11,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:11,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1003287393, now seen corresponding path program 2 times [2023-11-26 12:05:11,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:11,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945193502] [2023-11-26 12:05:11,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:11,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:12,406 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-26 12:05:12,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:12,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945193502] [2023-11-26 12:05:12,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945193502] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:12,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:12,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 12:05:12,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653109924] [2023-11-26 12:05:12,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:12,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 12:05:12,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:12,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 12:05:12,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-26 12:05:12,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 98 [2023-11-26 12:05:12,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 49 transitions, 381 flow. Second operand has 9 states, 9 states have (on average 19.444444444444443) internal successors, (175), 9 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:12,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:12,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 98 [2023-11-26 12:05:12,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:12,744 INFO L124 PetriNetUnfolderBase]: 117/275 cut-off events. [2023-11-26 12:05:12,744 INFO L125 PetriNetUnfolderBase]: For 1201/1218 co-relation queries the response was YES. [2023-11-26 12:05:12,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1168 conditions, 275 events. 117/275 cut-off events. For 1201/1218 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1180 event pairs, 37 based on Foata normal form. 17/291 useless extension candidates. Maximal degree in co-relation 1143. Up to 175 conditions per place. [2023-11-26 12:05:12,748 INFO L140 encePairwiseOnDemand]: 89/98 looper letters, 38 selfloop transitions, 11 changer transitions 8/68 dead transitions. [2023-11-26 12:05:12,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 68 transitions, 591 flow [2023-11-26 12:05:12,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 12:05:12,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 12:05:12,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2023-11-26 12:05:12,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.23979591836734693 [2023-11-26 12:05:12,751 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 188 transitions. [2023-11-26 12:05:12,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 188 transitions. [2023-11-26 12:05:12,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:12,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 188 transitions. [2023-11-26 12:05:12,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 23.5) internal successors, (188), 8 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:12,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 98.0) internal successors, (882), 9 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:12,763 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 98.0) internal successors, (882), 9 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:12,763 INFO L175 Difference]: Start difference. First operand has 67 places, 49 transitions, 381 flow. Second operand 8 states and 188 transitions. [2023-11-26 12:05:12,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 68 transitions, 591 flow [2023-11-26 12:05:12,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 68 transitions, 532 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-11-26 12:05:12,772 INFO L231 Difference]: Finished difference. Result has 70 places, 50 transitions, 375 flow [2023-11-26 12:05:12,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=375, PETRI_PLACES=70, PETRI_TRANSITIONS=50} [2023-11-26 12:05:12,773 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-26 12:05:12,773 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 50 transitions, 375 flow [2023-11-26 12:05:12,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.444444444444443) internal successors, (175), 9 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:12,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:12,774 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] [2023-11-26 12:05:12,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-26 12:05:12,775 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-26 12:05:12,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:12,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1366135622, now seen corresponding path program 1 times [2023-11-26 12:05:12,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:12,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363877001] [2023-11-26 12:05:12,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:12,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:13,082 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-26 12:05:13,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:13,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363877001] [2023-11-26 12:05:13,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363877001] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:13,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:13,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 12:05:13,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419477856] [2023-11-26 12:05:13,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:13,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:05:13,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:13,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:05:13,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:05:13,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 98 [2023-11-26 12:05:13,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 50 transitions, 375 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:13,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:13,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 98 [2023-11-26 12:05:13,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:13,296 INFO L124 PetriNetUnfolderBase]: 178/359 cut-off events. [2023-11-26 12:05:13,297 INFO L125 PetriNetUnfolderBase]: For 1355/1363 co-relation queries the response was YES. [2023-11-26 12:05:13,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1330 conditions, 359 events. 178/359 cut-off events. For 1355/1363 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1368 event pairs, 20 based on Foata normal form. 25/380 useless extension candidates. Maximal degree in co-relation 1305. Up to 187 conditions per place. [2023-11-26 12:05:13,300 INFO L140 encePairwiseOnDemand]: 93/98 looper letters, 40 selfloop transitions, 4 changer transitions 1/53 dead transitions. [2023-11-26 12:05:13,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 53 transitions, 446 flow [2023-11-26 12:05:13,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 12:05:13,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 12:05:13,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2023-11-26 12:05:13,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25255102040816324 [2023-11-26 12:05:13,303 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 99 transitions. [2023-11-26 12:05:13,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 99 transitions. [2023-11-26 12:05:13,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:13,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 99 transitions. [2023-11-26 12:05:13,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:13,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:13,306 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:13,306 INFO L175 Difference]: Start difference. First operand has 70 places, 50 transitions, 375 flow. Second operand 4 states and 99 transitions. [2023-11-26 12:05:13,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 53 transitions, 446 flow [2023-11-26 12:05:13,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 53 transitions, 380 flow, removed 18 selfloop flow, removed 12 redundant places. [2023-11-26 12:05:13,313 INFO L231 Difference]: Finished difference. Result has 61 places, 39 transitions, 226 flow [2023-11-26 12:05:13,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=61, PETRI_TRANSITIONS=39} [2023-11-26 12:05:13,315 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -13 predicate places. [2023-11-26 12:05:13,315 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 39 transitions, 226 flow [2023-11-26 12:05:13,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:13,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:13,316 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-26 12:05:13,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-26 12:05:13,316 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-26 12:05:13,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:13,317 INFO L85 PathProgramCache]: Analyzing trace with hash -898313578, now seen corresponding path program 1 times [2023-11-26 12:05:13,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:13,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275096209] [2023-11-26 12:05:13,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:13,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:13,623 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-26 12:05:13,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:13,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275096209] [2023-11-26 12:05:13,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275096209] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:13,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:13,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:05:13,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666317001] [2023-11-26 12:05:13,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:13,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:05:13,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:13,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:05:13,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:05:13,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 98 [2023-11-26 12:05:13,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 39 transitions, 226 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:13,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:13,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 98 [2023-11-26 12:05:13,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:13,809 INFO L124 PetriNetUnfolderBase]: 93/198 cut-off events. [2023-11-26 12:05:13,809 INFO L125 PetriNetUnfolderBase]: For 426/429 co-relation queries the response was YES. [2023-11-26 12:05:13,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 198 events. 93/198 cut-off events. For 426/429 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 569 event pairs, 13 based on Foata normal form. 16/211 useless extension candidates. Maximal degree in co-relation 671. Up to 78 conditions per place. [2023-11-26 12:05:13,811 INFO L140 encePairwiseOnDemand]: 93/98 looper letters, 30 selfloop transitions, 6 changer transitions 1/45 dead transitions. [2023-11-26 12:05:13,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 45 transitions, 318 flow [2023-11-26 12:05:13,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 12:05:13,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 12:05:13,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2023-11-26 12:05:13,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.23061224489795917 [2023-11-26 12:05:13,813 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 113 transitions. [2023-11-26 12:05:13,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 113 transitions. [2023-11-26 12:05:13,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:13,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 113 transitions. [2023-11-26 12:05:13,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:13,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:13,816 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:13,816 INFO L175 Difference]: Start difference. First operand has 61 places, 39 transitions, 226 flow. Second operand 5 states and 113 transitions. [2023-11-26 12:05:13,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 45 transitions, 318 flow [2023-11-26 12:05:13,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 45 transitions, 234 flow, removed 18 selfloop flow, removed 12 redundant places. [2023-11-26 12:05:13,819 INFO L231 Difference]: Finished difference. Result has 54 places, 34 transitions, 149 flow [2023-11-26 12:05:13,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=54, PETRI_TRANSITIONS=34} [2023-11-26 12:05:13,821 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -20 predicate places. [2023-11-26 12:05:13,821 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 34 transitions, 149 flow [2023-11-26 12:05:13,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:13,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:13,822 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-26 12:05:13,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-26 12:05:13,822 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-26 12:05:13,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:13,823 INFO L85 PathProgramCache]: Analyzing trace with hash -449403847, now seen corresponding path program 1 times [2023-11-26 12:05:13,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:13,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568148679] [2023-11-26 12:05:13,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:13,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:05:13,934 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:05:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:05:14,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:05:14,075 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 12:05:14,076 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (63 of 64 remaining) [2023-11-26 12:05:14,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (62 of 64 remaining) [2023-11-26 12:05:14,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 64 remaining) [2023-11-26 12:05:14,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 64 remaining) [2023-11-26 12:05:14,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 64 remaining) [2023-11-26 12:05:14,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 64 remaining) [2023-11-26 12:05:14,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 64 remaining) [2023-11-26 12:05:14,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 64 remaining) [2023-11-26 12:05:14,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 64 remaining) [2023-11-26 12:05:14,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 64 remaining) [2023-11-26 12:05:14,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 64 remaining) [2023-11-26 12:05:14,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 64 remaining) [2023-11-26 12:05:14,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 64 remaining) [2023-11-26 12:05:14,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 64 remaining) [2023-11-26 12:05:14,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 64 remaining) [2023-11-26 12:05:14,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 64 remaining) [2023-11-26 12:05:14,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 64 remaining) [2023-11-26 12:05:14,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 64 remaining) [2023-11-26 12:05:14,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 64 remaining) [2023-11-26 12:05:14,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 64 remaining) [2023-11-26 12:05:14,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 64 remaining) [2023-11-26 12:05:14,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 64 remaining) [2023-11-26 12:05:14,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 64 remaining) [2023-11-26 12:05:14,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 64 remaining) [2023-11-26 12:05:14,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 64 remaining) [2023-11-26 12:05:14,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 64 remaining) [2023-11-26 12:05:14,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 64 remaining) [2023-11-26 12:05:14,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 64 remaining) [2023-11-26 12:05:14,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 64 remaining) [2023-11-26 12:05:14,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 64 remaining) [2023-11-26 12:05:14,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 64 remaining) [2023-11-26 12:05:14,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 64 remaining) [2023-11-26 12:05:14,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 64 remaining) [2023-11-26 12:05:14,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 64 remaining) [2023-11-26 12:05:14,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 64 remaining) [2023-11-26 12:05:14,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 64 remaining) [2023-11-26 12:05:14,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (27 of 64 remaining) [2023-11-26 12:05:14,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 64 remaining) [2023-11-26 12:05:14,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 64 remaining) [2023-11-26 12:05:14,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 64 remaining) [2023-11-26 12:05:14,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 64 remaining) [2023-11-26 12:05:14,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 64 remaining) [2023-11-26 12:05:14,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 64 remaining) [2023-11-26 12:05:14,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 64 remaining) [2023-11-26 12:05:14,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 64 remaining) [2023-11-26 12:05:14,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 64 remaining) [2023-11-26 12:05:14,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 64 remaining) [2023-11-26 12:05:14,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 64 remaining) [2023-11-26 12:05:14,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 64 remaining) [2023-11-26 12:05:14,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 64 remaining) [2023-11-26 12:05:14,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 64 remaining) [2023-11-26 12:05:14,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 64 remaining) [2023-11-26 12:05:14,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 64 remaining) [2023-11-26 12:05:14,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 64 remaining) [2023-11-26 12:05:14,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 64 remaining) [2023-11-26 12:05:14,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 64 remaining) [2023-11-26 12:05:14,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 64 remaining) [2023-11-26 12:05:14,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 64 remaining) [2023-11-26 12:05:14,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 64 remaining) [2023-11-26 12:05:14,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 64 remaining) [2023-11-26 12:05:14,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 64 remaining) [2023-11-26 12:05:14,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 64 remaining) [2023-11-26 12:05:14,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 64 remaining) [2023-11-26 12:05:14,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 64 remaining) [2023-11-26 12:05:14,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-26 12:05:14,100 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:05:14,109 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 12:05:14,109 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 12:05:14,228 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre25 could not be translated [2023-11-26 12:05:14,233 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre27 could not be translated [2023-11-26 12:05:14,256 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 12:05:14,265 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 12:05:14,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:05:14 BasicIcfg [2023-11-26 12:05:14,292 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 12:05:14,293 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 12:05:14,293 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 12:05:14,293 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 12:05:14,294 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:04:47" (3/4) ... [2023-11-26 12:05:14,296 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 12:05:14,297 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 12:05:14,298 INFO L158 Benchmark]: Toolchain (without parser) took 29302.04ms. Allocated memory was 176.2MB in the beginning and 1.2GB in the end (delta: 985.7MB). Free memory was 146.6MB in the beginning and 739.1MB in the end (delta: -592.5MB). Peak memory consumption was 393.0MB. Max. memory is 16.1GB. [2023-11-26 12:05:14,299 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 130.0MB. Free memory is still 103.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 12:05:14,299 INFO L158 Benchmark]: CACSL2BoogieTranslator took 818.07ms. Allocated memory is still 176.2MB. Free memory was 147.2MB in the beginning and 123.2MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-26 12:05:14,300 INFO L158 Benchmark]: Boogie Procedure Inliner took 115.07ms. Allocated memory is still 176.2MB. Free memory was 123.2MB in the beginning and 120.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 12:05:14,300 INFO L158 Benchmark]: Boogie Preprocessor took 114.92ms. Allocated memory is still 176.2MB. Free memory was 120.8MB in the beginning and 116.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 12:05:14,301 INFO L158 Benchmark]: RCFGBuilder took 1676.71ms. Allocated memory is still 176.2MB. Free memory was 116.6MB in the beginning and 71.9MB in the end (delta: 44.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2023-11-26 12:05:14,301 INFO L158 Benchmark]: TraceAbstraction took 26551.85ms. Allocated memory was 176.2MB in the beginning and 1.2GB in the end (delta: 985.7MB). Free memory was 71.9MB in the beginning and 740.2MB in the end (delta: -668.3MB). Peak memory consumption was 317.4MB. Max. memory is 16.1GB. [2023-11-26 12:05:14,302 INFO L158 Benchmark]: Witness Printer took 4.96ms. Allocated memory is still 1.2GB. Free memory was 740.2MB in the beginning and 739.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 12:05:14,305 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.30ms. Allocated memory is still 130.0MB. Free memory is still 103.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 818.07ms. Allocated memory is still 176.2MB. Free memory was 147.2MB in the beginning and 123.2MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 115.07ms. Allocated memory is still 176.2MB. Free memory was 123.2MB in the beginning and 120.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 114.92ms. Allocated memory is still 176.2MB. Free memory was 120.8MB in the beginning and 116.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1676.71ms. Allocated memory is still 176.2MB. Free memory was 116.6MB in the beginning and 71.9MB in the end (delta: 44.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 26551.85ms. Allocated memory was 176.2MB in the beginning and 1.2GB in the end (delta: 985.7MB). Free memory was 71.9MB in the beginning and 740.2MB in the end (delta: -668.3MB). Peak memory consumption was 317.4MB. Max. memory is 16.1GB. * Witness Printer took 4.96ms. Allocated memory is still 1.2GB. Free memory was 740.2MB in the beginning and 739.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre25 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre27 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L713] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L714] 0 int __unbuffered_p1_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L721] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L722] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L723] 0 int __unbuffered_p1_EAX$w_buff0; [L724] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L725] 0 int __unbuffered_p1_EAX$w_buff1; [L726] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L727] 0 _Bool main$tmp_guard0; [L728] 0 _Bool main$tmp_guard1; [L730] 0 int x = 0; [L730] 0 int x = 0; [L731] 0 _Bool x$flush_delayed; [L732] 0 int x$mem_tmp; [L733] 0 _Bool x$r_buff0_thd0; [L734] 0 _Bool x$r_buff0_thd1; [L735] 0 _Bool x$r_buff0_thd2; [L736] 0 _Bool x$r_buff1_thd0; [L737] 0 _Bool x$r_buff1_thd1; [L738] 0 _Bool x$r_buff1_thd2; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice1; [L749] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1923; [L826] FCALL, FORK 0 pthread_create(&t1923, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1923={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L827] 0 pthread_t t1924; [L828] FCALL, FORK 0 pthread_create(&t1924, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1923={6:0}, t1924={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 2 x$flush_delayed = weak$$choice2 [L784] EXPR 2 \read(x) [L784] 2 x$mem_tmp = x [L785] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] EXPR 2 \read(x) [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L793] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L794] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L795] EXPR 2 \read(x) [L795] 2 __unbuffered_p1_EAX = x [L796] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L796] EXPR 2 \read(x) [L796] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L796] 2 x = x$flush_delayed ? x$mem_tmp : x [L797] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L800] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L803] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L803] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L803] EXPR 2 \read(x) [L803] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L803] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L803] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L804] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L805] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L806] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L807] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L753] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L756] 1 x$w_buff1 = x$w_buff0 [L757] 1 x$w_buff0 = 1 [L758] 1 x$w_buff1_used = x$w_buff0_used [L759] 1 x$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L767] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L767] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L767] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L768] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L769] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L770] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L771] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1923={6:0}, t1924={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 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) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] EXPR 0 \read(x) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] 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) [L834] 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) [L835] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L836] 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 [L837] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L838] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1923={6:0}, t1924={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L841] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L842] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L842] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L842] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L842] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L842] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L842] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L843] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1923={6:0}, t1924={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L845] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L17] 0 __assert_fail ("0", "safe006_power.opt-thin000_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 823]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 111 locations, 64 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: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 16.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 981 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 871 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2420 IncrementalHoareTripleChecker+Invalid, 2565 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 41 mSDtfsCounter, 2420 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=431occurred in iteration=13, InterpolantAutomatonStates: 123, 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.5s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 335 NumberOfCodeBlocks, 335 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 287 ConstructedInterpolants, 0 QuantifiedInterpolants, 2404 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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-26 12:05:14,358 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme --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 eec124b30114ac40ce6b503b76c1b377fc7c0cddd0ece3b04d579d49ce56e9b5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 12:05:17,039 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 12:05:17,129 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-26 12:05:17,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 12:05:17,136 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 12:05:17,167 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 12:05:17,168 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 12:05:17,168 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 12:05:17,169 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 12:05:17,170 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 12:05:17,171 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 12:05:17,171 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 12:05:17,172 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 12:05:17,173 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 12:05:17,173 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 12:05:17,174 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 12:05:17,175 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 12:05:17,175 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 12:05:17,176 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 12:05:17,176 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 12:05:17,177 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 12:05:17,178 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 12:05:17,178 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 12:05:17,179 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 12:05:17,179 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 12:05:17,180 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-26 12:05:17,180 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-26 12:05:17,181 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 12:05:17,181 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 12:05:17,182 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 12:05:17,182 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 12:05:17,183 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 12:05:17,183 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 12:05:17,184 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 12:05:17,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:05:17,185 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 12:05:17,185 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 12:05:17,186 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-26 12:05:17,186 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-26 12:05:17,187 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 12:05:17,187 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 12:05:17,188 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 12:05:17,189 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 12:05:17,189 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-26 12:05:17,190 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_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme/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_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme 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 -> eec124b30114ac40ce6b503b76c1b377fc7c0cddd0ece3b04d579d49ce56e9b5 [2023-11-26 12:05:17,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 12:05:17,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 12:05:17,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 12:05:17,613 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 12:05:17,613 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 12:05:17,615 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2023-11-26 12:05:21,005 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 12:05:21,367 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 12:05:21,368 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2023-11-26 12:05:21,394 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme/data/3df42c0cd/ca8db158bee44695bd684a210fa3229f/FLAG8fe53117a [2023-11-26 12:05:21,411 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme/data/3df42c0cd/ca8db158bee44695bd684a210fa3229f [2023-11-26 12:05:21,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 12:05:21,416 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 12:05:21,420 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 12:05:21,421 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 12:05:21,427 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 12:05:21,430 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:05:21" (1/1) ... [2023-11-26 12:05:21,431 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a16fb37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:21, skipping insertion in model container [2023-11-26 12:05:21,435 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:05:21" (1/1) ... [2023-11-26 12:05:21,515 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 12:05:21,981 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:05:21,999 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 12:05:22,113 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:05:22,238 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 12:05:22,239 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 12:05:22,247 INFO L206 MainTranslator]: Completed translation [2023-11-26 12:05:22,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:22 WrapperNode [2023-11-26 12:05:22,248 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 12:05:22,250 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 12:05:22,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 12:05:22,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 12:05:22,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:22" (1/1) ... [2023-11-26 12:05:22,297 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:22" (1/1) ... [2023-11-26 12:05:22,354 INFO L138 Inliner]: procedures = 179, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 170 [2023-11-26 12:05:22,354 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 12:05:22,356 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 12:05:22,356 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 12:05:22,356 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 12:05:22,368 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:22" (1/1) ... [2023-11-26 12:05:22,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:22" (1/1) ... [2023-11-26 12:05:22,385 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:22" (1/1) ... [2023-11-26 12:05:22,420 INFO L175 MemorySlicer]: Split 20 memory accesses to 4 slices as follows [2, 1, 16, 1]. 80 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1, 0]. The 7 writes are split as follows [0, 1, 5, 1]. [2023-11-26 12:05:22,421 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:22" (1/1) ... [2023-11-26 12:05:22,421 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:22" (1/1) ... [2023-11-26 12:05:22,439 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:22" (1/1) ... [2023-11-26 12:05:22,454 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:22" (1/1) ... [2023-11-26 12:05:22,459 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:22" (1/1) ... [2023-11-26 12:05:22,474 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:22" (1/1) ... [2023-11-26 12:05:22,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 12:05:22,480 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 12:05:22,480 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 12:05:22,481 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 12:05:22,481 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:22" (1/1) ... [2023-11-26 12:05:22,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:05:22,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:05:22,521 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 12:05:22,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 12:05:22,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-26 12:05:22,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-26 12:05:22,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-26 12:05:22,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-26 12:05:22,562 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 12:05:22,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 12:05:22,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 12:05:22,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 12:05:22,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-26 12:05:22,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-26 12:05:22,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-26 12:05:22,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-26 12:05:22,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-26 12:05:22,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-26 12:05:22,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-26 12:05:22,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-26 12:05:22,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-11-26 12:05:22,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-11-26 12:05:22,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-11-26 12:05:22,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-11-26 12:05:22,566 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-26 12:05:22,566 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-26 12:05:22,567 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-26 12:05:22,567 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-26 12:05:22,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 12:05:22,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 12:05:22,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 12:05:22,576 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 12:05:22,797 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 12:05:22,799 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 12:05:23,585 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 12:05:24,259 WARN L1821 r$LargeBlockEncoding]: Complex 4:9 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2023-11-26 12:05:24,424 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 12:05:24,425 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 12:05:24,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:05:24 BoogieIcfgContainer [2023-11-26 12:05:24,426 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 12:05:24,431 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 12:05:24,431 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 12:05:24,451 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 12:05:24,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:05:21" (1/3) ... [2023-11-26 12:05:24,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c3ab826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:05:24, skipping insertion in model container [2023-11-26 12:05:24,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:22" (2/3) ... [2023-11-26 12:05:24,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c3ab826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:05:24, skipping insertion in model container [2023-11-26 12:05:24,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:05:24" (3/3) ... [2023-11-26 12:05:24,459 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.opt-thin000_power.opt.i [2023-11-26 12:05:24,484 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 12:05:24,484 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2023-11-26 12:05:24,484 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 12:05:24,758 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 12:05:24,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 98 transitions, 204 flow [2023-11-26 12:05:24,881 INFO L124 PetriNetUnfolderBase]: 29/96 cut-off events. [2023-11-26 12:05:24,881 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 12:05:24,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 96 events. 29/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 293 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 93. Up to 4 conditions per place. [2023-11-26 12:05:24,889 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 98 transitions, 204 flow [2023-11-26 12:05:24,899 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 96 transitions, 198 flow [2023-11-26 12:05:24,919 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 12:05:24,927 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;@5479042b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 12:05:24,928 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2023-11-26 12:05:24,932 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 12:05:24,932 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-26 12:05:24,932 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 12:05:24,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:24,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 12:05:24,934 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-26 12:05:24,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:24,941 INFO L85 PathProgramCache]: Analyzing trace with hash 25051, now seen corresponding path program 1 times [2023-11-26 12:05:24,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:05:24,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900469601] [2023-11-26 12:05:24,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:24,982 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-26 12:05:24,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:05:24,986 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme/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-26 12:05:25,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3f68e-c997-461f-b8cf-c9a19b9b5d61/bin/uautomizer-verify-VRDe98Ueme/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-26 12:05:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:25,131 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 12:05:25,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:05:25,215 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-26 12:05:25,229 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-26 12:05:25,230 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:05:25,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:05:25,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900469601] [2023-11-26 12:05:25,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1900469601] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:25,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:25,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 12:05:25,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266092170] [2023-11-26 12:05:25,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:25,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:05:25,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:05:25,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:05:25,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:25,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 98 [2023-11-26 12:05:25,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 96 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:25,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:25,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 98 [2023-11-26 12:05:25,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand