./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/queue_ok.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_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/queue_ok.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:20:41,072 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:20:41,137 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-28 20:20:41,141 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:20:41,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:20:41,166 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:20:41,166 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:20:41,167 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:20:41,168 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:20:41,168 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:20:41,169 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:20:41,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:20:41,170 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:20:41,171 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:20:41,171 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:20:41,172 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:20:41,172 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:20:41,173 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:20:41,173 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:20:41,174 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:20:41,174 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-28 20:20:41,175 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-28 20:20:41,176 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-28 20:20:41,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:20:41,176 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 20:20:41,177 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 20:20:41,177 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:20:41,178 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:20:41,178 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:20:41,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:20:41,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:20:41,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:20:41,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:20:41,180 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:20:41,180 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:20:41,180 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 20:20:41,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 20:20:41,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:20:41,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:20:41,181 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:20:41,181 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:20:41,182 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_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 [2023-11-28 20:20:41,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:20:41,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:20:41,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:20:41,437 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:20:41,437 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:20:41,438 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread/queue_ok.i [2023-11-28 20:20:44,132 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:20:44,365 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:20:44,366 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/sv-benchmarks/c/pthread/queue_ok.i [2023-11-28 20:20:44,384 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/data/f320ddb19/989617de626349c49559b9ae2bd1003f/FLAG5fb8d56cd [2023-11-28 20:20:44,415 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/data/f320ddb19/989617de626349c49559b9ae2bd1003f [2023-11-28 20:20:44,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:20:44,427 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:20:44,429 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:20:44,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:20:44,456 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:20:44,457 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:20:44" (1/1) ... [2023-11-28 20:20:44,458 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ad2f2cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:44, skipping insertion in model container [2023-11-28 20:20:44,458 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:20:44" (1/1) ... [2023-11-28 20:20:44,517 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:20:45,015 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:20:45,027 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:20:45,078 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:20:45,147 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:20:45,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45 WrapperNode [2023-11-28 20:20:45,148 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:20:45,149 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:20:45,149 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:20:45,149 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:20:45,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (1/1) ... [2023-11-28 20:20:45,177 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (1/1) ... [2023-11-28 20:20:45,207 INFO L138 Inliner]: procedures = 275, calls = 61, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 214 [2023-11-28 20:20:45,208 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:20:45,209 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:20:45,209 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:20:45,209 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:20:45,221 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (1/1) ... [2023-11-28 20:20:45,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (1/1) ... [2023-11-28 20:20:45,227 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (1/1) ... [2023-11-28 20:20:45,245 INFO L175 MemorySlicer]: Split 38 memory accesses to 6 slices as follows [2, 5, 3, 2, 24, 2]. 63 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0, 0, 0, 0]. The 15 writes are split as follows [0, 0, 2, 1, 11, 1]. [2023-11-28 20:20:45,246 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (1/1) ... [2023-11-28 20:20:45,246 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (1/1) ... [2023-11-28 20:20:45,256 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (1/1) ... [2023-11-28 20:20:45,259 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (1/1) ... [2023-11-28 20:20:45,262 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (1/1) ... [2023-11-28 20:20:45,264 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (1/1) ... [2023-11-28 20:20:45,267 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:20:45,268 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:20:45,268 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:20:45,268 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:20:45,269 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (1/1) ... [2023-11-28 20:20:45,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:20:45,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:20:45,300 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:20:45,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:20:45,340 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-28 20:20:45,340 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-28 20:20:45,340 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-28 20:20:45,340 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-28 20:20:45,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 20:20:45,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 20:20:45,341 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-28 20:20:45,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-28 20:20:45,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-28 20:20:45,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-28 20:20:45,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-28 20:20:45,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-28 20:20:45,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-28 20:20:45,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-28 20:20:45,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-28 20:20:45,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-28 20:20:45,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-28 20:20:45,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-28 20:20:45,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-28 20:20:45,342 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-28 20:20:45,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:20:45,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-28 20:20:45,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-28 20:20:45,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-28 20:20:45,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-28 20:20:45,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-28 20:20:45,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-28 20:20:45,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:20:45,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:20:45,345 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-28 20:20:45,523 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:20:45,524 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:20:45,955 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:20:46,145 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:20:46,147 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-28 20:20:46,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:20:46 BoogieIcfgContainer [2023-11-28 20:20:46,148 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:20:46,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:20:46,151 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:20:46,155 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:20:46,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:20:44" (1/3) ... [2023-11-28 20:20:46,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b339c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:20:46, skipping insertion in model container [2023-11-28 20:20:46,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:45" (2/3) ... [2023-11-28 20:20:46,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b339c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:20:46, skipping insertion in model container [2023-11-28 20:20:46,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:20:46" (3/3) ... [2023-11-28 20:20:46,160 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2023-11-28 20:20:46,180 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:20:46,181 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2023-11-28 20:20:46,181 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-28 20:20:46,278 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-28 20:20:46,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 142 transitions, 298 flow [2023-11-28 20:20:46,374 INFO L124 PetriNetUnfolderBase]: 11/140 cut-off events. [2023-11-28 20:20:46,375 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-28 20:20:46,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 140 events. 11/140 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 470 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 105. Up to 3 conditions per place. [2023-11-28 20:20:46,381 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 142 transitions, 298 flow [2023-11-28 20:20:46,388 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 139 transitions, 290 flow [2023-11-28 20:20:46,398 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:20:46,405 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;@4b3c4faf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:20:46,406 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2023-11-28 20:20:46,409 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-28 20:20:46,409 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-28 20:20:46,410 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 20:20:46,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:20:46,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-28 20:20:46,411 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-28 20:20:46,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:46,417 INFO L85 PathProgramCache]: Analyzing trace with hash 18931, now seen corresponding path program 1 times [2023-11-28 20:20:46,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:46,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575748269] [2023-11-28 20:20:46,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:46,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:46,783 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-28 20:20:46,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:20:46,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575748269] [2023-11-28 20:20:46,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575748269] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:20:46,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:20:46,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 20:20:46,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691016911] [2023-11-28 20:20:46,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:20:46,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:20:46,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:20:46,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:20:46,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:20:46,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 142 [2023-11-28 20:20:46,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 139 transitions, 290 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:46,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:20:46,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 142 [2023-11-28 20:20:46,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:20:47,520 INFO L124 PetriNetUnfolderBase]: 1079/2979 cut-off events. [2023-11-28 20:20:47,521 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-11-28 20:20:47,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4743 conditions, 2979 events. 1079/2979 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 23515 event pairs, 831 based on Foata normal form. 66/2136 useless extension candidates. Maximal degree in co-relation 4543. Up to 1708 conditions per place. [2023-11-28 20:20:47,558 INFO L140 encePairwiseOnDemand]: 134/142 looper letters, 49 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2023-11-28 20:20:47,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 127 transitions, 368 flow [2023-11-28 20:20:47,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:20:47,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:20:47,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2023-11-28 20:20:47,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6971830985915493 [2023-11-28 20:20:47,574 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 297 transitions. [2023-11-28 20:20:47,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 297 transitions. [2023-11-28 20:20:47,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:20:47,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 297 transitions. [2023-11-28 20:20:47,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:47,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:47,588 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:47,590 INFO L175 Difference]: Start difference. First operand has 135 places, 139 transitions, 290 flow. Second operand 3 states and 297 transitions. [2023-11-28 20:20:47,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 127 transitions, 368 flow [2023-11-28 20:20:47,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 127 transitions, 360 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-28 20:20:47,600 INFO L231 Difference]: Finished difference. Result has 125 places, 127 transitions, 262 flow [2023-11-28 20:20:47,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=125, PETRI_TRANSITIONS=127} [2023-11-28 20:20:47,606 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -10 predicate places. [2023-11-28 20:20:47,607 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 127 transitions, 262 flow [2023-11-28 20:20:47,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:47,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:20:47,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-28 20:20:47,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 20:20:47,609 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-28 20:20:47,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:47,609 INFO L85 PathProgramCache]: Analyzing trace with hash 18932, now seen corresponding path program 1 times [2023-11-28 20:20:47,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:47,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185746863] [2023-11-28 20:20:47,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:47,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:47,768 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-28 20:20:47,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:20:47,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185746863] [2023-11-28 20:20:47,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185746863] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:20:47,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:20:47,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 20:20:47,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414065012] [2023-11-28 20:20:47,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:20:47,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:20:47,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:20:47,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:20:47,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:20:47,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 142 [2023-11-28 20:20:47,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 127 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:47,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:20:47,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 142 [2023-11-28 20:20:47,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:20:48,299 INFO L124 PetriNetUnfolderBase]: 1079/2976 cut-off events. [2023-11-28 20:20:48,300 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-28 20:20:48,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4704 conditions, 2976 events. 1079/2976 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 23481 event pairs, 831 based on Foata normal form. 3/2070 useless extension candidates. Maximal degree in co-relation 4693. Up to 1708 conditions per place. [2023-11-28 20:20:48,328 INFO L140 encePairwiseOnDemand]: 137/142 looper letters, 47 selfloop transitions, 2 changer transitions 0/124 dead transitions. [2023-11-28 20:20:48,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 124 transitions, 354 flow [2023-11-28 20:20:48,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:20:48,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:20:48,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2023-11-28 20:20:48,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6995305164319249 [2023-11-28 20:20:48,332 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 298 transitions. [2023-11-28 20:20:48,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 298 transitions. [2023-11-28 20:20:48,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:20:48,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 298 transitions. [2023-11-28 20:20:48,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:48,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:48,337 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:48,338 INFO L175 Difference]: Start difference. First operand has 125 places, 127 transitions, 262 flow. Second operand 3 states and 298 transitions. [2023-11-28 20:20:48,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 124 transitions, 354 flow [2023-11-28 20:20:48,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 124 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:20:48,342 INFO L231 Difference]: Finished difference. Result has 122 places, 124 transitions, 256 flow [2023-11-28 20:20:48,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=122, PETRI_TRANSITIONS=124} [2023-11-28 20:20:48,343 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -13 predicate places. [2023-11-28 20:20:48,344 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 124 transitions, 256 flow [2023-11-28 20:20:48,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:48,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:20:48,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 20:20:48,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-28 20:20:48,345 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-28 20:20:48,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:48,346 INFO L85 PathProgramCache]: Analyzing trace with hash 564545759, now seen corresponding path program 1 times [2023-11-28 20:20:48,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:48,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902831707] [2023-11-28 20:20:48,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:48,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:48,431 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-28 20:20:48,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:20:48,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902831707] [2023-11-28 20:20:48,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902831707] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:20:48,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:20:48,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:20:48,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594452912] [2023-11-28 20:20:48,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:20:48,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:20:48,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:20:48,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:20:48,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:20:48,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 142 [2023-11-28 20:20:48,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 124 transitions, 256 flow. Second operand has 5 states, 5 states have (on average 78.0) internal successors, (390), 5 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:48,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:20:48,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 142 [2023-11-28 20:20:48,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:20:49,038 INFO L124 PetriNetUnfolderBase]: 1079/2974 cut-off events. [2023-11-28 20:20:49,038 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-28 20:20:49,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4705 conditions, 2974 events. 1079/2974 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 23506 event pairs, 831 based on Foata normal form. 0/2068 useless extension candidates. Maximal degree in co-relation 4692. Up to 1707 conditions per place. [2023-11-28 20:20:49,066 INFO L140 encePairwiseOnDemand]: 137/142 looper letters, 49 selfloop transitions, 3 changer transitions 0/122 dead transitions. [2023-11-28 20:20:49,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 122 transitions, 356 flow [2023-11-28 20:20:49,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:20:49,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-28 20:20:49,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 362 transitions. [2023-11-28 20:20:49,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6373239436619719 [2023-11-28 20:20:49,069 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 362 transitions. [2023-11-28 20:20:49,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 362 transitions. [2023-11-28 20:20:49,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:20:49,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 362 transitions. [2023-11-28 20:20:49,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:49,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:49,074 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:49,074 INFO L175 Difference]: Start difference. First operand has 122 places, 124 transitions, 256 flow. Second operand 4 states and 362 transitions. [2023-11-28 20:20:49,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 122 transitions, 356 flow [2023-11-28 20:20:49,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 122 transitions, 352 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:20:49,078 INFO L231 Difference]: Finished difference. Result has 121 places, 122 transitions, 254 flow [2023-11-28 20:20:49,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=254, PETRI_PLACES=121, PETRI_TRANSITIONS=122} [2023-11-28 20:20:49,079 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -14 predicate places. [2023-11-28 20:20:49,080 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 122 transitions, 254 flow [2023-11-28 20:20:49,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 78.0) internal successors, (390), 5 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:49,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:20:49,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 20:20:49,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-28 20:20:49,081 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-28 20:20:49,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:49,082 INFO L85 PathProgramCache]: Analyzing trace with hash 564545760, now seen corresponding path program 1 times [2023-11-28 20:20:49,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:49,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124676101] [2023-11-28 20:20:49,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:49,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:49,220 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-28 20:20:49,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:20:49,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124676101] [2023-11-28 20:20:49,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124676101] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:20:49,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:20:49,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:20:49,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324066384] [2023-11-28 20:20:49,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:20:49,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:20:49,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:20:49,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:20:49,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:20:49,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 142 [2023-11-28 20:20:49,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 122 transitions, 254 flow. Second operand has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:49,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:20:49,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 142 [2023-11-28 20:20:49,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:20:49,800 INFO L124 PetriNetUnfolderBase]: 1079/2972 cut-off events. [2023-11-28 20:20:49,800 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-28 20:20:49,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4701 conditions, 2972 events. 1079/2972 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 23499 event pairs, 831 based on Foata normal form. 2/2068 useless extension candidates. Maximal degree in co-relation 4686. Up to 1707 conditions per place. [2023-11-28 20:20:49,825 INFO L140 encePairwiseOnDemand]: 137/142 looper letters, 46 selfloop transitions, 3 changer transitions 0/120 dead transitions. [2023-11-28 20:20:49,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 120 transitions, 348 flow [2023-11-28 20:20:49,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:20:49,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-28 20:20:49,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 383 transitions. [2023-11-28 20:20:49,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6742957746478874 [2023-11-28 20:20:49,828 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 383 transitions. [2023-11-28 20:20:49,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 383 transitions. [2023-11-28 20:20:49,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:20:49,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 383 transitions. [2023-11-28 20:20:49,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:49,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:49,833 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:49,833 INFO L175 Difference]: Start difference. First operand has 121 places, 122 transitions, 254 flow. Second operand 4 states and 383 transitions. [2023-11-28 20:20:49,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 120 transitions, 348 flow [2023-11-28 20:20:49,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 120 transitions, 342 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-28 20:20:49,836 INFO L231 Difference]: Finished difference. Result has 119 places, 120 transitions, 250 flow [2023-11-28 20:20:49,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=250, PETRI_PLACES=119, PETRI_TRANSITIONS=120} [2023-11-28 20:20:49,838 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -16 predicate places. [2023-11-28 20:20:49,838 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 120 transitions, 250 flow [2023-11-28 20:20:49,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:49,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:20:49,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:20:49,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-28 20:20:49,839 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-28 20:20:49,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:49,840 INFO L85 PathProgramCache]: Analyzing trace with hash -495210249, now seen corresponding path program 1 times [2023-11-28 20:20:49,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:49,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754057630] [2023-11-28 20:20:49,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:49,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:49,931 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-28 20:20:49,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:20:49,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754057630] [2023-11-28 20:20:49,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754057630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:20:49,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:20:49,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 20:20:49,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296925402] [2023-11-28 20:20:49,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:20:49,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:20:49,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:20:49,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:20:49,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:20:50,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 142 [2023-11-28 20:20:50,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 120 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:50,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:20:50,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 142 [2023-11-28 20:20:50,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:20:50,469 INFO L124 PetriNetUnfolderBase]: 1736/4461 cut-off events. [2023-11-28 20:20:50,469 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-28 20:20:50,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7136 conditions, 4461 events. 1736/4461 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 37053 event pairs, 1369 based on Foata normal form. 0/3158 useless extension candidates. Maximal degree in co-relation 7121. Up to 2653 conditions per place. [2023-11-28 20:20:50,500 INFO L140 encePairwiseOnDemand]: 138/142 looper letters, 49 selfloop transitions, 2 changer transitions 0/118 dead transitions. [2023-11-28 20:20:50,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 118 transitions, 348 flow [2023-11-28 20:20:50,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:20:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:20:50,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-11-28 20:20:50,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6948356807511737 [2023-11-28 20:20:50,502 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-11-28 20:20:50,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-11-28 20:20:50,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:20:50,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-11-28 20:20:50,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:50,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:50,506 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:50,506 INFO L175 Difference]: Start difference. First operand has 119 places, 120 transitions, 250 flow. Second operand 3 states and 296 transitions. [2023-11-28 20:20:50,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 118 transitions, 348 flow [2023-11-28 20:20:50,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 118 transitions, 342 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-28 20:20:50,509 INFO L231 Difference]: Finished difference. Result has 116 places, 118 transitions, 244 flow [2023-11-28 20:20:50,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=116, PETRI_TRANSITIONS=118} [2023-11-28 20:20:50,510 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -19 predicate places. [2023-11-28 20:20:50,511 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 118 transitions, 244 flow [2023-11-28 20:20:50,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:50,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:20:50,511 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:20:50,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-28 20:20:50,512 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-28 20:20:50,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:50,512 INFO L85 PathProgramCache]: Analyzing trace with hash -495210248, now seen corresponding path program 1 times [2023-11-28 20:20:50,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:50,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981088609] [2023-11-28 20:20:50,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:50,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:50,630 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-28 20:20:50,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:20:50,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981088609] [2023-11-28 20:20:50,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981088609] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:20:50,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:20:50,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 20:20:50,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041129190] [2023-11-28 20:20:50,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:20:50,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:20:50,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:20:50,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:20:50,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:20:50,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 142 [2023-11-28 20:20:50,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 118 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:50,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:20:50,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 142 [2023-11-28 20:20:50,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:20:51,043 INFO L124 PetriNetUnfolderBase]: 1079/2960 cut-off events. [2023-11-28 20:20:51,043 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-28 20:20:51,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4688 conditions, 2960 events. 1079/2960 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 23357 event pairs, 831 based on Foata normal form. 289/2355 useless extension candidates. Maximal degree in co-relation 4678. Up to 1707 conditions per place. [2023-11-28 20:20:51,054 INFO L140 encePairwiseOnDemand]: 138/142 looper letters, 47 selfloop transitions, 2 changer transitions 0/116 dead transitions. [2023-11-28 20:20:51,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 116 transitions, 338 flow [2023-11-28 20:20:51,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:20:51,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:20:51,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2023-11-28 20:20:51,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.704225352112676 [2023-11-28 20:20:51,056 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 300 transitions. [2023-11-28 20:20:51,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 300 transitions. [2023-11-28 20:20:51,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:20:51,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 300 transitions. [2023-11-28 20:20:51,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:51,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:51,059 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:51,059 INFO L175 Difference]: Start difference. First operand has 116 places, 118 transitions, 244 flow. Second operand 3 states and 300 transitions. [2023-11-28 20:20:51,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 116 transitions, 338 flow [2023-11-28 20:20:51,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 116 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:20:51,062 INFO L231 Difference]: Finished difference. Result has 114 places, 116 transitions, 240 flow [2023-11-28 20:20:51,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=114, PETRI_TRANSITIONS=116} [2023-11-28 20:20:51,063 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -21 predicate places. [2023-11-28 20:20:51,063 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 116 transitions, 240 flow [2023-11-28 20:20:51,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:51,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:20:51,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:20:51,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-28 20:20:51,064 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-28 20:20:51,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:51,065 INFO L85 PathProgramCache]: Analyzing trace with hash 404867781, now seen corresponding path program 1 times [2023-11-28 20:20:51,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:51,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020638704] [2023-11-28 20:20:51,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:51,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:51,125 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-28 20:20:51,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:20:51,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020638704] [2023-11-28 20:20:51,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020638704] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:20:51,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:20:51,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 20:20:51,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066933466] [2023-11-28 20:20:51,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:20:51,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:20:51,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:20:51,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:20:51,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:20:51,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 142 [2023-11-28 20:20:51,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 116 transitions, 240 flow. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:51,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:20:51,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 142 [2023-11-28 20:20:51,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:20:51,535 INFO L124 PetriNetUnfolderBase]: 1120/3057 cut-off events. [2023-11-28 20:20:51,535 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-28 20:20:51,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4862 conditions, 3057 events. 1120/3057 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 24191 event pairs, 865 based on Foata normal form. 0/2152 useless extension candidates. Maximal degree in co-relation 4852. Up to 1783 conditions per place. [2023-11-28 20:20:51,552 INFO L140 encePairwiseOnDemand]: 138/142 looper letters, 49 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2023-11-28 20:20:51,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 114 transitions, 338 flow [2023-11-28 20:20:51,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:20:51,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:20:51,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-11-28 20:20:51,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6948356807511737 [2023-11-28 20:20:51,555 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-11-28 20:20:51,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-11-28 20:20:51,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:20:51,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-11-28 20:20:51,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:51,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:51,559 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:51,559 INFO L175 Difference]: Start difference. First operand has 114 places, 116 transitions, 240 flow. Second operand 3 states and 296 transitions. [2023-11-28 20:20:51,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 114 transitions, 338 flow [2023-11-28 20:20:51,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 114 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:20:51,562 INFO L231 Difference]: Finished difference. Result has 112 places, 114 transitions, 236 flow [2023-11-28 20:20:51,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=112, PETRI_TRANSITIONS=114} [2023-11-28 20:20:51,564 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -23 predicate places. [2023-11-28 20:20:51,564 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 114 transitions, 236 flow [2023-11-28 20:20:51,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:51,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:20:51,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:20:51,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-28 20:20:51,565 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-28 20:20:51,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:51,566 INFO L85 PathProgramCache]: Analyzing trace with hash 404867782, now seen corresponding path program 1 times [2023-11-28 20:20:51,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:51,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272722992] [2023-11-28 20:20:51,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:51,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:51,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:20:51,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:20:51,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272722992] [2023-11-28 20:20:51,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272722992] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:20:51,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:20:51,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 20:20:51,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366644740] [2023-11-28 20:20:51,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:20:51,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:20:51,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:20:51,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:20:51,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:20:51,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 142 [2023-11-28 20:20:51,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 114 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:51,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:20:51,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 142 [2023-11-28 20:20:51,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:20:52,121 INFO L124 PetriNetUnfolderBase]: 1079/2938 cut-off events. [2023-11-28 20:20:52,121 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-28 20:20:52,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4666 conditions, 2938 events. 1079/2938 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 23063 event pairs, 831 based on Foata normal form. 31/2097 useless extension candidates. Maximal degree in co-relation 4656. Up to 1707 conditions per place. [2023-11-28 20:20:52,137 INFO L140 encePairwiseOnDemand]: 138/142 looper letters, 47 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2023-11-28 20:20:52,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 112 transitions, 330 flow [2023-11-28 20:20:52,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:20:52,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:20:52,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2023-11-28 20:20:52,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.704225352112676 [2023-11-28 20:20:52,139 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 300 transitions. [2023-11-28 20:20:52,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 300 transitions. [2023-11-28 20:20:52,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:20:52,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 300 transitions. [2023-11-28 20:20:52,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:52,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:52,142 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:52,142 INFO L175 Difference]: Start difference. First operand has 112 places, 114 transitions, 236 flow. Second operand 3 states and 300 transitions. [2023-11-28 20:20:52,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 112 transitions, 330 flow [2023-11-28 20:20:52,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 112 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:20:52,145 INFO L231 Difference]: Finished difference. Result has 110 places, 112 transitions, 232 flow [2023-11-28 20:20:52,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=110, PETRI_TRANSITIONS=112} [2023-11-28 20:20:52,146 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -25 predicate places. [2023-11-28 20:20:52,146 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 112 transitions, 232 flow [2023-11-28 20:20:52,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:52,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:20:52,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:20:52,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-28 20:20:52,147 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-28 20:20:52,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:52,148 INFO L85 PathProgramCache]: Analyzing trace with hash -495378663, now seen corresponding path program 1 times [2023-11-28 20:20:52,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:52,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793654630] [2023-11-28 20:20:52,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:52,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:52,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-28 20:20:52,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:20:52,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793654630] [2023-11-28 20:20:52,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793654630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:20:52,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:20:52,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:20:52,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465577080] [2023-11-28 20:20:52,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:20:52,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:20:52,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:20:52,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:20:52,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:20:52,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 142 [2023-11-28 20:20:52,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 112 transitions, 232 flow. Second operand has 6 states, 6 states have (on average 79.83333333333333) internal successors, (479), 6 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:52,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:20:52,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 142 [2023-11-28 20:20:52,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:20:53,154 INFO L124 PetriNetUnfolderBase]: 1078/2725 cut-off events. [2023-11-28 20:20:53,154 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-28 20:20:53,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4450 conditions, 2725 events. 1078/2725 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 20412 event pairs, 434 based on Foata normal form. 126/2213 useless extension candidates. Maximal degree in co-relation 4440. Up to 889 conditions per place. [2023-11-28 20:20:53,165 INFO L140 encePairwiseOnDemand]: 130/142 looper letters, 68 selfloop transitions, 5 changer transitions 0/129 dead transitions. [2023-11-28 20:20:53,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 129 transitions, 413 flow [2023-11-28 20:20:53,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:20:53,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:20:53,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 548 transitions. [2023-11-28 20:20:53,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6431924882629108 [2023-11-28 20:20:53,168 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 548 transitions. [2023-11-28 20:20:53,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 548 transitions. [2023-11-28 20:20:53,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:20:53,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 548 transitions. [2023-11-28 20:20:53,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:53,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 142.0) internal successors, (994), 7 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:53,171 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 142.0) internal successors, (994), 7 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:53,171 INFO L175 Difference]: Start difference. First operand has 110 places, 112 transitions, 232 flow. Second operand 6 states and 548 transitions. [2023-11-28 20:20:53,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 129 transitions, 413 flow [2023-11-28 20:20:53,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 129 transitions, 409 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:20:53,174 INFO L231 Difference]: Finished difference. Result has 106 places, 105 transitions, 224 flow [2023-11-28 20:20:53,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=224, PETRI_PLACES=106, PETRI_TRANSITIONS=105} [2023-11-28 20:20:53,175 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -29 predicate places. [2023-11-28 20:20:53,175 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 105 transitions, 224 flow [2023-11-28 20:20:53,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.83333333333333) internal successors, (479), 6 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:53,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:20:53,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:20:53,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-28 20:20:53,176 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-28 20:20:53,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:53,176 INFO L85 PathProgramCache]: Analyzing trace with hash -495378664, now seen corresponding path program 1 times [2023-11-28 20:20:53,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:53,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153065348] [2023-11-28 20:20:53,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:53,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:53,261 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-28 20:20:53,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:20:53,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153065348] [2023-11-28 20:20:53,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153065348] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:20:53,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:20:53,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:20:53,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322973913] [2023-11-28 20:20:53,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:20:53,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:20:53,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:20:53,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:20:53,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:20:53,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 142 [2023-11-28 20:20:53,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 105 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 71.16666666666667) internal successors, (427), 6 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:53,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:20:53,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 142 [2023-11-28 20:20:53,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:20:53,778 INFO L124 PetriNetUnfolderBase]: 1276/2627 cut-off events. [2023-11-28 20:20:53,778 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2023-11-28 20:20:53,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4758 conditions, 2627 events. 1276/2627 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 16867 event pairs, 446 based on Foata normal form. 0/2153 useless extension candidates. Maximal degree in co-relation 1978. Up to 1138 conditions per place. [2023-11-28 20:20:53,788 INFO L140 encePairwiseOnDemand]: 129/142 looper letters, 73 selfloop transitions, 5 changer transitions 0/121 dead transitions. [2023-11-28 20:20:53,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 121 transitions, 413 flow [2023-11-28 20:20:53,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 20:20:53,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 20:20:53,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 431 transitions. [2023-11-28 20:20:53,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6070422535211267 [2023-11-28 20:20:53,790 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 431 transitions. [2023-11-28 20:20:53,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 431 transitions. [2023-11-28 20:20:53,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:20:53,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 431 transitions. [2023-11-28 20:20:53,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:53,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:53,793 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:53,793 INFO L175 Difference]: Start difference. First operand has 106 places, 105 transitions, 224 flow. Second operand 5 states and 431 transitions. [2023-11-28 20:20:53,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 121 transitions, 413 flow [2023-11-28 20:20:53,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 121 transitions, 403 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-28 20:20:53,796 INFO L231 Difference]: Finished difference. Result has 97 places, 97 transitions, 208 flow [2023-11-28 20:20:53,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=208, PETRI_PLACES=97, PETRI_TRANSITIONS=97} [2023-11-28 20:20:53,797 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -38 predicate places. [2023-11-28 20:20:53,797 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 97 transitions, 208 flow [2023-11-28 20:20:53,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.16666666666667) internal successors, (427), 6 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:53,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:20:53,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:20:53,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-28 20:20:53,798 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-28 20:20:53,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:53,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1823131262, now seen corresponding path program 1 times [2023-11-28 20:20:53,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:53,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007083529] [2023-11-28 20:20:53,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:53,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:54,204 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-28 20:20:54,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:20:54,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007083529] [2023-11-28 20:20:54,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007083529] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:20:54,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:20:54,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:20:54,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45157445] [2023-11-28 20:20:54,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:20:54,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 20:20:54,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:20:54,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 20:20:54,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:20:54,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 142 [2023-11-28 20:20:54,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 97 transitions, 208 flow. Second operand has 8 states, 8 states have (on average 72.625) internal successors, (581), 8 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:54,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:20:54,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 142 [2023-11-28 20:20:54,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:20:55,540 INFO L124 PetriNetUnfolderBase]: 2060/4303 cut-off events. [2023-11-28 20:20:55,540 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2023-11-28 20:20:55,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7724 conditions, 4303 events. 2060/4303 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 30361 event pairs, 286 based on Foata normal form. 0/3498 useless extension candidates. Maximal degree in co-relation 2867. Up to 2158 conditions per place. [2023-11-28 20:20:55,560 INFO L140 encePairwiseOnDemand]: 132/142 looper letters, 133 selfloop transitions, 12 changer transitions 0/188 dead transitions. [2023-11-28 20:20:55,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 188 transitions, 689 flow [2023-11-28 20:20:55,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 20:20:55,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-28 20:20:55,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 715 transitions. [2023-11-28 20:20:55,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6294014084507042 [2023-11-28 20:20:55,564 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 715 transitions. [2023-11-28 20:20:55,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 715 transitions. [2023-11-28 20:20:55,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:20:55,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 715 transitions. [2023-11-28 20:20:55,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 89.375) internal successors, (715), 8 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:55,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 142.0) internal successors, (1278), 9 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:55,571 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 142.0) internal successors, (1278), 9 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:55,571 INFO L175 Difference]: Start difference. First operand has 97 places, 97 transitions, 208 flow. Second operand 8 states and 715 transitions. [2023-11-28 20:20:55,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 188 transitions, 689 flow [2023-11-28 20:20:55,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 188 transitions, 675 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-28 20:20:55,576 INFO L231 Difference]: Finished difference. Result has 104 places, 107 transitions, 274 flow [2023-11-28 20:20:55,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=274, PETRI_PLACES=104, PETRI_TRANSITIONS=107} [2023-11-28 20:20:55,577 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -31 predicate places. [2023-11-28 20:20:55,577 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 107 transitions, 274 flow [2023-11-28 20:20:55,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 72.625) internal successors, (581), 8 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:55,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:20:55,578 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-28 20:20:55,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-28 20:20:55,578 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-28 20:20:55,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:55,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1765301932, now seen corresponding path program 1 times [2023-11-28 20:20:55,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:55,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863513297] [2023-11-28 20:20:55,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:55,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:55,685 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-28 20:20:55,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:20:55,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863513297] [2023-11-28 20:20:55,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863513297] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:20:55,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:20:55,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:20:55,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690694981] [2023-11-28 20:20:55,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:20:55,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:20:55,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:20:55,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:20:55,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:20:55,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 142 [2023-11-28 20:20:55,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 107 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:55,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:20:55,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 142 [2023-11-28 20:20:55,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:20:56,400 INFO L124 PetriNetUnfolderBase]: 1881/4238 cut-off events. [2023-11-28 20:20:56,400 INFO L125 PetriNetUnfolderBase]: For 314/314 co-relation queries the response was YES. [2023-11-28 20:20:56,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7860 conditions, 4238 events. 1881/4238 cut-off events. For 314/314 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 31909 event pairs, 1238 based on Foata normal form. 0/3457 useless extension candidates. Maximal degree in co-relation 7461. Up to 2632 conditions per place. [2023-11-28 20:20:56,417 INFO L140 encePairwiseOnDemand]: 135/142 looper letters, 77 selfloop transitions, 5 changer transitions 0/127 dead transitions. [2023-11-28 20:20:56,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 127 transitions, 499 flow [2023-11-28 20:20:56,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 20:20:56,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 20:20:56,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 457 transitions. [2023-11-28 20:20:56,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.643661971830986 [2023-11-28 20:20:56,419 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 457 transitions. [2023-11-28 20:20:56,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 457 transitions. [2023-11-28 20:20:56,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:20:56,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 457 transitions. [2023-11-28 20:20:56,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:56,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:56,422 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:56,422 INFO L175 Difference]: Start difference. First operand has 104 places, 107 transitions, 274 flow. Second operand 5 states and 457 transitions. [2023-11-28 20:20:56,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 127 transitions, 499 flow [2023-11-28 20:20:56,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 127 transitions, 495 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:20:56,426 INFO L231 Difference]: Finished difference. Result has 104 places, 105 transitions, 276 flow [2023-11-28 20:20:56,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=276, PETRI_PLACES=104, PETRI_TRANSITIONS=105} [2023-11-28 20:20:56,427 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -31 predicate places. [2023-11-28 20:20:56,427 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 105 transitions, 276 flow [2023-11-28 20:20:56,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:56,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:20:56,428 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-28 20:20:56,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-28 20:20:56,428 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-28 20:20:56,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:56,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1765301933, now seen corresponding path program 1 times [2023-11-28 20:20:56,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:56,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352554958] [2023-11-28 20:20:56,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:56,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:56,503 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-28 20:20:56,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:20:56,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352554958] [2023-11-28 20:20:56,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352554958] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:20:56,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:20:56,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:20:56,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109667707] [2023-11-28 20:20:56,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:20:56,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:20:56,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:20:56,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:20:56,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:20:56,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 142 [2023-11-28 20:20:56,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 105 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:56,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:20:56,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 142 [2023-11-28 20:20:56,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:20:56,731 INFO L124 PetriNetUnfolderBase]: 693/1675 cut-off events. [2023-11-28 20:20:56,731 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-11-28 20:20:56,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3173 conditions, 1675 events. 693/1675 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 10577 event pairs, 447 based on Foata normal form. 43/1501 useless extension candidates. Maximal degree in co-relation 3129. Up to 698 conditions per place. [2023-11-28 20:20:56,741 INFO L140 encePairwiseOnDemand]: 138/142 looper letters, 62 selfloop transitions, 3 changer transitions 0/113 dead transitions. [2023-11-28 20:20:56,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 113 transitions, 415 flow [2023-11-28 20:20:56,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:20:56,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:20:56,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2023-11-28 20:20:56,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.744131455399061 [2023-11-28 20:20:56,743 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions. [2023-11-28 20:20:56,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions. [2023-11-28 20:20:56,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:20:56,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions. [2023-11-28 20:20:56,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:56,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:56,746 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:56,746 INFO L175 Difference]: Start difference. First operand has 104 places, 105 transitions, 276 flow. Second operand 3 states and 317 transitions. [2023-11-28 20:20:56,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 113 transitions, 415 flow [2023-11-28 20:20:56,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 113 transitions, 401 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-11-28 20:20:56,750 INFO L231 Difference]: Finished difference. Result has 101 places, 101 transitions, 255 flow [2023-11-28 20:20:56,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=255, PETRI_PLACES=101, PETRI_TRANSITIONS=101} [2023-11-28 20:20:56,751 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -34 predicate places. [2023-11-28 20:20:56,751 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 101 transitions, 255 flow [2023-11-28 20:20:56,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:56,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:20:56,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:20:56,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-28 20:20:56,752 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-28 20:20:56,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:56,753 INFO L85 PathProgramCache]: Analyzing trace with hash 893561673, now seen corresponding path program 1 times [2023-11-28 20:20:56,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:56,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626321168] [2023-11-28 20:20:56,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:56,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:56,803 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-28 20:20:56,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:20:56,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626321168] [2023-11-28 20:20:56,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626321168] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:20:56,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:20:56,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:20:56,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484119462] [2023-11-28 20:20:56,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:20:56,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:20:56,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:20:56,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:20:56,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:20:56,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 142 [2023-11-28 20:20:56,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 101 transitions, 255 flow. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:56,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:20:56,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 142 [2023-11-28 20:20:56,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:20:57,010 INFO L124 PetriNetUnfolderBase]: 572/1398 cut-off events. [2023-11-28 20:20:57,010 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2023-11-28 20:20:57,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2689 conditions, 1398 events. 572/1398 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 7860 event pairs, 380 based on Foata normal form. 12/1232 useless extension candidates. Maximal degree in co-relation 1719. Up to 763 conditions per place. [2023-11-28 20:20:57,017 INFO L140 encePairwiseOnDemand]: 139/142 looper letters, 64 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2023-11-28 20:20:57,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 114 transitions, 411 flow [2023-11-28 20:20:57,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:20:57,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:20:57,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 322 transitions. [2023-11-28 20:20:57,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.755868544600939 [2023-11-28 20:20:57,019 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 322 transitions. [2023-11-28 20:20:57,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 322 transitions. [2023-11-28 20:20:57,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:20:57,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 322 transitions. [2023-11-28 20:20:57,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:57,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:57,022 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:57,022 INFO L175 Difference]: Start difference. First operand has 101 places, 101 transitions, 255 flow. Second operand 3 states and 322 transitions. [2023-11-28 20:20:57,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 114 transitions, 411 flow [2023-11-28 20:20:57,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 114 transitions, 403 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-28 20:20:57,026 INFO L231 Difference]: Finished difference. Result has 102 places, 101 transitions, 254 flow [2023-11-28 20:20:57,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=254, PETRI_PLACES=102, PETRI_TRANSITIONS=101} [2023-11-28 20:20:57,027 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -33 predicate places. [2023-11-28 20:20:57,027 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 101 transitions, 254 flow [2023-11-28 20:20:57,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:57,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:20:57,027 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:20:57,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-28 20:20:57,028 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-28 20:20:57,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:57,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1790474274, now seen corresponding path program 1 times [2023-11-28 20:20:57,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:57,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855640204] [2023-11-28 20:20:57,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:57,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:57,566 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-28 20:20:57,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:20:57,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855640204] [2023-11-28 20:20:57,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855640204] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:20:57,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:20:57,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-28 20:20:57,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560719172] [2023-11-28 20:20:57,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:20:57,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 20:20:57,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:20:57,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 20:20:57,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:20:57,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 142 [2023-11-28 20:20:57,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 101 transitions, 254 flow. Second operand has 9 states, 9 states have (on average 82.11111111111111) internal successors, (739), 9 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:57,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:20:57,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 142 [2023-11-28 20:20:57,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:20:58,275 INFO L124 PetriNetUnfolderBase]: 643/1459 cut-off events. [2023-11-28 20:20:58,275 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2023-11-28 20:20:58,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2904 conditions, 1459 events. 643/1459 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 7879 event pairs, 168 based on Foata normal form. 0/1306 useless extension candidates. Maximal degree in co-relation 954. Up to 773 conditions per place. [2023-11-28 20:20:58,278 INFO L140 encePairwiseOnDemand]: 132/142 looper letters, 95 selfloop transitions, 9 changer transitions 0/145 dead transitions. [2023-11-28 20:20:58,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 145 transitions, 554 flow [2023-11-28 20:20:58,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 20:20:58,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-28 20:20:58,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 824 transitions. [2023-11-28 20:20:58,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6447574334898278 [2023-11-28 20:20:58,282 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 824 transitions. [2023-11-28 20:20:58,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 824 transitions. [2023-11-28 20:20:58,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:20:58,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 824 transitions. [2023-11-28 20:20:58,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 91.55555555555556) internal successors, (824), 9 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:58,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 142.0) internal successors, (1420), 10 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:58,288 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 142.0) internal successors, (1420), 10 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:58,288 INFO L175 Difference]: Start difference. First operand has 102 places, 101 transitions, 254 flow. Second operand 9 states and 824 transitions. [2023-11-28 20:20:58,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 145 transitions, 554 flow [2023-11-28 20:20:58,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 145 transitions, 550 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-28 20:20:58,292 INFO L231 Difference]: Finished difference. Result has 111 places, 102 transitions, 279 flow [2023-11-28 20:20:58,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=279, PETRI_PLACES=111, PETRI_TRANSITIONS=102} [2023-11-28 20:20:58,293 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -24 predicate places. [2023-11-28 20:20:58,293 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 102 transitions, 279 flow [2023-11-28 20:20:58,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 82.11111111111111) internal successors, (739), 9 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:58,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:20:58,294 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-28 20:20:58,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-28 20:20:58,294 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-28 20:20:58,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:58,295 INFO L85 PathProgramCache]: Analyzing trace with hash -328796433, now seen corresponding path program 1 times [2023-11-28 20:20:58,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:58,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597531775] [2023-11-28 20:20:58,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:58,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:58,501 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-28 20:20:58,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:20:58,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597531775] [2023-11-28 20:20:58,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597531775] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:20:58,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:20:58,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:20:58,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298143433] [2023-11-28 20:20:58,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:20:58,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:20:58,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:20:58,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:20:58,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:20:58,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 142 [2023-11-28 20:20:58,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 102 transitions, 279 flow. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:58,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:20:58,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 142 [2023-11-28 20:20:58,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:20:58,827 INFO L124 PetriNetUnfolderBase]: 575/1377 cut-off events. [2023-11-28 20:20:58,828 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2023-11-28 20:20:58,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2819 conditions, 1377 events. 575/1377 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 7588 event pairs, 395 based on Foata normal form. 12/1247 useless extension candidates. Maximal degree in co-relation 1572. Up to 789 conditions per place. [2023-11-28 20:20:58,834 INFO L140 encePairwiseOnDemand]: 138/142 looper letters, 63 selfloop transitions, 3 changer transitions 0/113 dead transitions. [2023-11-28 20:20:58,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 113 transitions, 434 flow [2023-11-28 20:20:58,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:20:58,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-28 20:20:58,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 403 transitions. [2023-11-28 20:20:58,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7095070422535211 [2023-11-28 20:20:58,836 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 403 transitions. [2023-11-28 20:20:58,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 403 transitions. [2023-11-28 20:20:58,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:20:58,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 403 transitions. [2023-11-28 20:20:58,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:58,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:58,840 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:58,840 INFO L175 Difference]: Start difference. First operand has 111 places, 102 transitions, 279 flow. Second operand 4 states and 403 transitions. [2023-11-28 20:20:58,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 113 transitions, 434 flow [2023-11-28 20:20:58,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 113 transitions, 420 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-28 20:20:58,844 INFO L231 Difference]: Finished difference. Result has 109 places, 102 transitions, 275 flow [2023-11-28 20:20:58,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=275, PETRI_PLACES=109, PETRI_TRANSITIONS=102} [2023-11-28 20:20:58,845 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -26 predicate places. [2023-11-28 20:20:58,845 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 102 transitions, 275 flow [2023-11-28 20:20:58,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:58,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:20:58,846 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-28 20:20:58,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-28 20:20:58,846 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-28 20:20:58,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:58,846 INFO L85 PathProgramCache]: Analyzing trace with hash -328796434, now seen corresponding path program 1 times [2023-11-28 20:20:58,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:58,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898392597] [2023-11-28 20:20:58,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:58,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:20:58,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:20:58,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:20:58,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898392597] [2023-11-28 20:20:58,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898392597] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:20:58,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:20:58,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:20:58,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673737447] [2023-11-28 20:20:58,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:20:58,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:20:58,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:20:58,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:20:58,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:20:59,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 142 [2023-11-28 20:20:59,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 102 transitions, 275 flow. Second operand has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:59,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:20:59,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 142 [2023-11-28 20:20:59,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:20:59,379 INFO L124 PetriNetUnfolderBase]: 901/1966 cut-off events. [2023-11-28 20:20:59,379 INFO L125 PetriNetUnfolderBase]: For 292/292 co-relation queries the response was YES. [2023-11-28 20:20:59,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4034 conditions, 1966 events. 901/1966 cut-off events. For 292/292 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 11095 event pairs, 837 based on Foata normal form. 34/1816 useless extension candidates. Maximal degree in co-relation 1672. Up to 1532 conditions per place. [2023-11-28 20:20:59,385 INFO L140 encePairwiseOnDemand]: 138/142 looper letters, 55 selfloop transitions, 2 changer transitions 0/100 dead transitions. [2023-11-28 20:20:59,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 100 transitions, 385 flow [2023-11-28 20:20:59,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:20:59,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:20:59,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 294 transitions. [2023-11-28 20:20:59,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6901408450704225 [2023-11-28 20:20:59,388 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 294 transitions. [2023-11-28 20:20:59,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 294 transitions. [2023-11-28 20:20:59,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:20:59,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 294 transitions. [2023-11-28 20:20:59,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:59,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:59,390 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:59,391 INFO L175 Difference]: Start difference. First operand has 109 places, 102 transitions, 275 flow. Second operand 3 states and 294 transitions. [2023-11-28 20:20:59,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 100 transitions, 385 flow [2023-11-28 20:20:59,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 100 transitions, 379 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-28 20:20:59,395 INFO L231 Difference]: Finished difference. Result has 106 places, 100 transitions, 269 flow [2023-11-28 20:20:59,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=269, PETRI_PLACES=106, PETRI_TRANSITIONS=100} [2023-11-28 20:20:59,395 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -29 predicate places. [2023-11-28 20:20:59,396 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 100 transitions, 269 flow [2023-11-28 20:20:59,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:20:59,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:20:59,396 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 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-28 20:20:59,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-28 20:20:59,397 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-28 20:20:59,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:20:59,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1646577762, now seen corresponding path program 1 times [2023-11-28 20:20:59,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:20:59,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240494283] [2023-11-28 20:20:59,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:20:59,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:20:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:00,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:21:00,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:00,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240494283] [2023-11-28 20:21:00,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240494283] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:21:00,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97072236] [2023-11-28 20:21:00,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:00,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:21:00,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:21:00,283 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:21:00,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-28 20:21:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:00,444 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-28 20:21:00,452 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:21:00,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-28 20:21:00,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-28 20:21:00,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:21:00,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:21:00,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2023-11-28 20:21:00,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-11-28 20:21:01,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-28 20:21:01,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:21:01,165 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:21:27,088 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#4| |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse1 .cse2))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17|) (forall ((v_ArrVal_340 Int)) (<= 0 (+ (* (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17|)) v_ArrVal_340) .cse2) 4) |c_~#queue~0.offset| 4))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17| Int)) (or (forall ((v_ArrVal_340 Int)) (<= (+ (* (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17|)) v_ArrVal_340) .cse2) 4) |c_~#queue~0.offset| 8) (select |c_#length| |c_~#queue~0.base|))) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17|)))))) is different from false [2023-11-28 20:21:27,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:21:27,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 117 [2023-11-28 20:21:27,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:21:27,558 INFO L349 Elim1Store]: treesize reduction 47, result has 39.7 percent of original size [2023-11-28 20:21:27,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 102 [2023-11-28 20:21:27,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 68 [2023-11-28 20:21:27,605 INFO L349 Elim1Store]: treesize reduction 10, result has 47.4 percent of original size [2023-11-28 20:21:27,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 71 [2023-11-28 20:21:27,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:21:27,664 INFO L349 Elim1Store]: treesize reduction 57, result has 26.9 percent of original size [2023-11-28 20:21:27,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 91 [2023-11-28 20:21:27,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2023-11-28 20:21:27,680 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:21:27,695 INFO L349 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-11-28 20:21:27,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 21 [2023-11-28 20:21:27,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-28 20:21:27,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97072236] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:21:27,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:21:27,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 31 [2023-11-28 20:21:27,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574201529] [2023-11-28 20:21:27,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:21:27,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-28 20:21:27,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:27,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-28 20:21:27,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=844, Unknown=3, NotChecked=60, Total=1056 [2023-11-28 20:21:31,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:21:31,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 142 [2023-11-28 20:21:31,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 100 transitions, 269 flow. Second operand has 33 states, 33 states have (on average 30.454545454545453) internal successors, (1005), 33 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:31,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:21:31,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 142 [2023-11-28 20:21:31,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:21:34,669 INFO L124 PetriNetUnfolderBase]: 2548/4664 cut-off events. [2023-11-28 20:21:34,669 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2023-11-28 20:21:34,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10008 conditions, 4664 events. 2548/4664 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 26330 event pairs, 429 based on Foata normal form. 36/4349 useless extension candidates. Maximal degree in co-relation 9965. Up to 1645 conditions per place. [2023-11-28 20:21:34,682 INFO L140 encePairwiseOnDemand]: 130/142 looper letters, 250 selfloop transitions, 21 changer transitions 0/287 dead transitions. [2023-11-28 20:21:34,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 287 transitions, 1249 flow [2023-11-28 20:21:34,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-28 20:21:34,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-28 20:21:34,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 720 transitions. [2023-11-28 20:21:34,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31690140845070425 [2023-11-28 20:21:34,687 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 720 transitions. [2023-11-28 20:21:34,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 720 transitions. [2023-11-28 20:21:34,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:21:34,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 720 transitions. [2023-11-28 20:21:34,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 45.0) internal successors, (720), 16 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:34,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 142.0) internal successors, (2414), 17 states have internal predecessors, (2414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:34,695 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 142.0) internal successors, (2414), 17 states have internal predecessors, (2414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:34,695 INFO L175 Difference]: Start difference. First operand has 106 places, 100 transitions, 269 flow. Second operand 16 states and 720 transitions. [2023-11-28 20:21:34,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 287 transitions, 1249 flow [2023-11-28 20:21:34,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 287 transitions, 1239 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:21:34,702 INFO L231 Difference]: Finished difference. Result has 123 places, 114 transitions, 379 flow [2023-11-28 20:21:34,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=379, PETRI_PLACES=123, PETRI_TRANSITIONS=114} [2023-11-28 20:21:34,703 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -12 predicate places. [2023-11-28 20:21:34,703 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 114 transitions, 379 flow [2023-11-28 20:21:34,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 30.454545454545453) internal successors, (1005), 33 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:34,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:21:34,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:21:34,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-28 20:21:34,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-28 20:21:34,905 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-28 20:21:34,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:34,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1620089800, now seen corresponding path program 1 times [2023-11-28 20:21:34,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:34,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035604104] [2023-11-28 20:21:34,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:34,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:35,013 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-28 20:21:35,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:35,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035604104] [2023-11-28 20:21:35,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035604104] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:35,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:35,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:21:35,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205022570] [2023-11-28 20:21:35,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:35,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:21:35,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:35,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:21:35,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:21:35,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 142 [2023-11-28 20:21:35,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 114 transitions, 379 flow. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:35,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:21:35,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 142 [2023-11-28 20:21:35,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:21:35,394 INFO L124 PetriNetUnfolderBase]: 1019/2394 cut-off events. [2023-11-28 20:21:35,394 INFO L125 PetriNetUnfolderBase]: For 490/490 co-relation queries the response was YES. [2023-11-28 20:21:35,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5227 conditions, 2394 events. 1019/2394 cut-off events. For 490/490 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 14686 event pairs, 661 based on Foata normal form. 12/2165 useless extension candidates. Maximal degree in co-relation 4065. Up to 1089 conditions per place. [2023-11-28 20:21:35,406 INFO L140 encePairwiseOnDemand]: 138/142 looper letters, 75 selfloop transitions, 3 changer transitions 0/125 dead transitions. [2023-11-28 20:21:35,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 125 transitions, 560 flow [2023-11-28 20:21:35,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:21:35,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:21:35,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2023-11-28 20:21:35,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7370892018779343 [2023-11-28 20:21:35,408 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2023-11-28 20:21:35,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2023-11-28 20:21:35,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:21:35,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2023-11-28 20:21:35,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:35,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:35,411 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:35,411 INFO L175 Difference]: Start difference. First operand has 123 places, 114 transitions, 379 flow. Second operand 3 states and 314 transitions. [2023-11-28 20:21:35,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 125 transitions, 560 flow [2023-11-28 20:21:35,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 125 transitions, 530 flow, removed 9 selfloop flow, removed 6 redundant places. [2023-11-28 20:21:35,418 INFO L231 Difference]: Finished difference. Result has 119 places, 113 transitions, 353 flow [2023-11-28 20:21:35,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=353, PETRI_PLACES=119, PETRI_TRANSITIONS=113} [2023-11-28 20:21:35,418 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -16 predicate places. [2023-11-28 20:21:35,419 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 113 transitions, 353 flow [2023-11-28 20:21:35,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:35,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:21:35,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:21:35,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-28 20:21:35,419 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-28 20:21:35,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:35,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1988889243, now seen corresponding path program 1 times [2023-11-28 20:21:35,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:35,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474790242] [2023-11-28 20:21:35,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:35,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:35,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:21:35,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:35,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474790242] [2023-11-28 20:21:35,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474790242] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:35,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:35,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:21:35,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163411954] [2023-11-28 20:21:35,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:35,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:21:35,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:35,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:21:35,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:21:35,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 142 [2023-11-28 20:21:35,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 113 transitions, 353 flow. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:35,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:21:35,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 142 [2023-11-28 20:21:35,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:21:35,803 INFO L124 PetriNetUnfolderBase]: 710/1849 cut-off events. [2023-11-28 20:21:35,803 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2023-11-28 20:21:35,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4013 conditions, 1849 events. 710/1849 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 10902 event pairs, 126 based on Foata normal form. 72/1751 useless extension candidates. Maximal degree in co-relation 3095. Up to 1103 conditions per place. [2023-11-28 20:21:35,809 INFO L140 encePairwiseOnDemand]: 138/142 looper letters, 70 selfloop transitions, 4 changer transitions 0/121 dead transitions. [2023-11-28 20:21:35,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 121 transitions, 519 flow [2023-11-28 20:21:35,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:21:35,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:21:35,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2023-11-28 20:21:35,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7370892018779343 [2023-11-28 20:21:35,811 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2023-11-28 20:21:35,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2023-11-28 20:21:35,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:21:35,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2023-11-28 20:21:35,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:35,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:35,813 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:35,813 INFO L175 Difference]: Start difference. First operand has 119 places, 113 transitions, 353 flow. Second operand 3 states and 314 transitions. [2023-11-28 20:21:35,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 121 transitions, 519 flow [2023-11-28 20:21:35,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 121 transitions, 513 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:21:35,818 INFO L231 Difference]: Finished difference. Result has 119 places, 113 transitions, 355 flow [2023-11-28 20:21:35,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=355, PETRI_PLACES=119, PETRI_TRANSITIONS=113} [2023-11-28 20:21:35,819 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -16 predicate places. [2023-11-28 20:21:35,819 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 113 transitions, 355 flow [2023-11-28 20:21:35,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:35,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:21:35,820 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:21:35,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-28 20:21:35,820 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-28 20:21:35,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:35,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1648931394, now seen corresponding path program 1 times [2023-11-28 20:21:35,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:35,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283326615] [2023-11-28 20:21:35,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:35,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:35,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:36,629 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:21:36,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:36,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283326615] [2023-11-28 20:21:36,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283326615] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:21:36,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227940131] [2023-11-28 20:21:36,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:36,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:21:36,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:21:36,631 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:21:36,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-28 20:21:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:36,798 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-28 20:21:36,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:21:36,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-28 20:21:36,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-28 20:21:37,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:21:37,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:21:37,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2023-11-28 20:21:37,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-11-28 20:21:37,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-28 20:21:37,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-28 20:21:37,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-28 20:21:37,363 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:21:37,363 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:21:39,450 INFO L349 Elim1Store]: treesize reduction 68, result has 31.3 percent of original size [2023-11-28 20:21:39,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 190 treesize of output 169 [2023-11-28 20:21:39,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:21:39,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 128 [2023-11-28 20:21:39,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-28 20:21:39,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:21:39,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 136 treesize of output 130 [2023-11-28 20:21:39,625 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:21:39,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227940131] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:21:39,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:21:39,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 14] total 37 [2023-11-28 20:21:39,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902790436] [2023-11-28 20:21:39,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:21:39,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-28 20:21:39,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:39,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-28 20:21:39,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=1162, Unknown=0, NotChecked=0, Total=1406 [2023-11-28 20:21:49,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 142 [2023-11-28 20:21:49,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 113 transitions, 355 flow. Second operand has 38 states, 38 states have (on average 81.34210526315789) internal successors, (3091), 38 states have internal predecessors, (3091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:49,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:21:49,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 142 [2023-11-28 20:21:49,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:21:51,904 INFO L124 PetriNetUnfolderBase]: 835/1990 cut-off events. [2023-11-28 20:21:51,904 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2023-11-28 20:21:51,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4506 conditions, 1990 events. 835/1990 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 11028 event pairs, 108 based on Foata normal form. 0/1832 useless extension candidates. Maximal degree in co-relation 3098. Up to 541 conditions per place. [2023-11-28 20:21:51,911 INFO L140 encePairwiseOnDemand]: 127/142 looper letters, 180 selfloop transitions, 30 changer transitions 0/247 dead transitions. [2023-11-28 20:21:51,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 247 transitions, 1114 flow [2023-11-28 20:21:51,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-28 20:21:51,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-11-28 20:21:51,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1871 transitions. [2023-11-28 20:21:51,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6274312541918176 [2023-11-28 20:21:51,917 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1871 transitions. [2023-11-28 20:21:51,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1871 transitions. [2023-11-28 20:21:51,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:21:51,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1871 transitions. [2023-11-28 20:21:51,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 89.0952380952381) internal successors, (1871), 21 states have internal predecessors, (1871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:51,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 142.0) internal successors, (3124), 22 states have internal predecessors, (3124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:51,930 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 142.0) internal successors, (3124), 22 states have internal predecessors, (3124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:51,930 INFO L175 Difference]: Start difference. First operand has 119 places, 113 transitions, 355 flow. Second operand 21 states and 1871 transitions. [2023-11-28 20:21:51,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 247 transitions, 1114 flow [2023-11-28 20:21:51,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 247 transitions, 1102 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 20:21:51,938 INFO L231 Difference]: Finished difference. Result has 141 places, 119 transitions, 459 flow [2023-11-28 20:21:51,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=459, PETRI_PLACES=141, PETRI_TRANSITIONS=119} [2023-11-28 20:21:51,939 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 6 predicate places. [2023-11-28 20:21:51,939 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 119 transitions, 459 flow [2023-11-28 20:21:51,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 81.34210526315789) internal successors, (3091), 38 states have internal predecessors, (3091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:51,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:21:51,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:21:51,946 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-28 20:21:52,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-28 20:21:52,141 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-28 20:21:52,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:52,141 INFO L85 PathProgramCache]: Analyzing trace with hash -623315496, now seen corresponding path program 1 times [2023-11-28 20:21:52,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:52,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540330005] [2023-11-28 20:21:52,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:52,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:52,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:21:52,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:52,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540330005] [2023-11-28 20:21:52,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540330005] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:21:52,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663818958] [2023-11-28 20:21:52,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:52,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:21:52,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:21:52,213 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:21:52,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-28 20:21:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:52,372 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 20:21:52,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:21:52,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:21:52,391 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:21:52,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:21:52,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663818958] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:21:52,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:21:52,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-28 20:21:52,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694899691] [2023-11-28 20:21:52,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:21:52,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 20:21:52,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:52,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 20:21:52,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:21:52,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 142 [2023-11-28 20:21:52,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 119 transitions, 459 flow. Second operand has 7 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:52,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:21:52,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 142 [2023-11-28 20:21:52,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:21:52,707 INFO L124 PetriNetUnfolderBase]: 566/1409 cut-off events. [2023-11-28 20:21:52,707 INFO L125 PetriNetUnfolderBase]: For 476/476 co-relation queries the response was YES. [2023-11-28 20:21:52,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3679 conditions, 1409 events. 566/1409 cut-off events. For 476/476 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6096 event pairs, 161 based on Foata normal form. 30/1356 useless extension candidates. Maximal degree in co-relation 1783. Up to 349 conditions per place. [2023-11-28 20:21:52,712 INFO L140 encePairwiseOnDemand]: 138/142 looper letters, 92 selfloop transitions, 6 changer transitions 0/147 dead transitions. [2023-11-28 20:21:52,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 147 transitions, 723 flow [2023-11-28 20:21:52,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:21:52,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:21:52,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 610 transitions. [2023-11-28 20:21:52,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.715962441314554 [2023-11-28 20:21:52,714 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 610 transitions. [2023-11-28 20:21:52,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 610 transitions. [2023-11-28 20:21:52,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:21:52,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 610 transitions. [2023-11-28 20:21:52,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:52,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 142.0) internal successors, (994), 7 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:52,718 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 142.0) internal successors, (994), 7 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:52,718 INFO L175 Difference]: Start difference. First operand has 141 places, 119 transitions, 459 flow. Second operand 6 states and 610 transitions. [2023-11-28 20:21:52,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 147 transitions, 723 flow [2023-11-28 20:21:52,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 147 transitions, 661 flow, removed 8 selfloop flow, removed 17 redundant places. [2023-11-28 20:21:52,726 INFO L231 Difference]: Finished difference. Result has 133 places, 120 transitions, 427 flow [2023-11-28 20:21:52,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=427, PETRI_PLACES=133, PETRI_TRANSITIONS=120} [2023-11-28 20:21:52,727 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -2 predicate places. [2023-11-28 20:21:52,727 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 120 transitions, 427 flow [2023-11-28 20:21:52,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:52,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:21:52,727 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:21:52,732 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-28 20:21:52,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:21:52,928 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-28 20:21:52,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:52,928 INFO L85 PathProgramCache]: Analyzing trace with hash 423810259, now seen corresponding path program 1 times [2023-11-28 20:21:52,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:52,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762701785] [2023-11-28 20:21:52,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:52,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:53,125 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:21:53,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:53,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762701785] [2023-11-28 20:21:53,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762701785] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:21:53,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262723957] [2023-11-28 20:21:53,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:53,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:21:53,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:21:53,127 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:21:53,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-28 20:21:53,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:53,301 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-28 20:21:53,304 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:21:53,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:21:53,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-28 20:21:53,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:21:53,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:21:53,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2023-11-28 20:21:53,603 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:21:53,603 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:21:53,770 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:21:53,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262723957] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:21:53,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:21:53,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2023-11-28 20:21:53,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921098715] [2023-11-28 20:21:53,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:21:53,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-28 20:21:53,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:53,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-28 20:21:53,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-11-28 20:21:54,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 142 [2023-11-28 20:21:54,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 120 transitions, 427 flow. Second operand has 12 states, 12 states have (on average 90.83333333333333) internal successors, (1090), 12 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:54,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:21:54,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 142 [2023-11-28 20:21:54,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:21:55,020 INFO L124 PetriNetUnfolderBase]: 676/1629 cut-off events. [2023-11-28 20:21:55,020 INFO L125 PetriNetUnfolderBase]: For 699/699 co-relation queries the response was YES. [2023-11-28 20:21:55,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4234 conditions, 1629 events. 676/1629 cut-off events. For 699/699 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 7458 event pairs, 261 based on Foata normal form. 30/1576 useless extension candidates. Maximal degree in co-relation 1854. Up to 566 conditions per place. [2023-11-28 20:21:55,026 INFO L140 encePairwiseOnDemand]: 137/142 looper letters, 102 selfloop transitions, 7 changer transitions 0/157 dead transitions. [2023-11-28 20:21:55,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 157 transitions, 770 flow [2023-11-28 20:21:55,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 20:21:55,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-28 20:21:55,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 782 transitions. [2023-11-28 20:21:55,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6883802816901409 [2023-11-28 20:21:55,028 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 782 transitions. [2023-11-28 20:21:55,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 782 transitions. [2023-11-28 20:21:55,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:21:55,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 782 transitions. [2023-11-28 20:21:55,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 97.75) internal successors, (782), 8 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:55,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 142.0) internal successors, (1278), 9 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:55,031 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 142.0) internal successors, (1278), 9 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:55,031 INFO L175 Difference]: Start difference. First operand has 133 places, 120 transitions, 427 flow. Second operand 8 states and 782 transitions. [2023-11-28 20:21:55,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 157 transitions, 770 flow [2023-11-28 20:21:55,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 157 transitions, 760 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-28 20:21:55,037 INFO L231 Difference]: Finished difference. Result has 142 places, 121 transitions, 453 flow [2023-11-28 20:21:55,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=453, PETRI_PLACES=142, PETRI_TRANSITIONS=121} [2023-11-28 20:21:55,038 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 7 predicate places. [2023-11-28 20:21:55,038 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 121 transitions, 453 flow [2023-11-28 20:21:55,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 90.83333333333333) internal successors, (1090), 12 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:55,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:21:55,038 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:21:55,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-28 20:21:55,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:21:55,239 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-28 20:21:55,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:55,239 INFO L85 PathProgramCache]: Analyzing trace with hash 738668258, now seen corresponding path program 2 times [2023-11-28 20:21:55,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:55,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661162466] [2023-11-28 20:21:55,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:55,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:57,154 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:21:57,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:57,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661162466] [2023-11-28 20:21:57,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661162466] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:21:57,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335251048] [2023-11-28 20:21:57,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 20:21:57,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:21:57,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:21:57,155 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:21:57,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15fa5c5c-9eb9-437c-b150-d36bde9a283d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-28 20:21:57,326 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-28 20:21:57,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:21:57,330 INFO L262 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 112 conjunts are in the unsatisfiable core [2023-11-28 20:21:57,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:21:57,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-28 20:21:57,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-28 20:21:57,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-28 20:21:57,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:21:57,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:21:57,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:21:57,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2023-11-28 20:21:57,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2023-11-28 20:21:58,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-11-28 20:21:58,352 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2023-11-28 20:21:58,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 24 [2023-11-28 20:21:58,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-28 20:21:58,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-28 20:21:58,809 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2023-11-28 20:21:58,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2023-11-28 20:21:58,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2023-11-28 20:21:59,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2023-11-28 20:21:59,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-28 20:21:59,286 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:21:59,286 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:25:18,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:25:18,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 128 [2023-11-28 20:27:12,693 INFO L349 Elim1Store]: treesize reduction 118, result has 25.8 percent of original size [2023-11-28 20:27:12,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 538 treesize of output 432 [2023-11-28 20:27:12,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:27:12,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 320 treesize of output 306 [2023-11-28 20:27:12,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-28 20:27:12,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:27:12,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 222 treesize of output 226 [2023-11-28 20:27:13,062 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 41 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:27:13,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335251048] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:27:13,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:27:13,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23, 29] total 71 [2023-11-28 20:27:13,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385330306] [2023-11-28 20:27:13,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:27:13,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2023-11-28 20:27:13,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:27:13,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2023-11-28 20:27:13,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=733, Invalid=4457, Unknown=66, NotChecked=0, Total=5256 [2023-11-28 20:27:17,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:27:21,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:27:25,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:27:26,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:27:31,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:27:35,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:27:39,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:27:43,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:27:47,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:27:51,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:27:56,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:28:00,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:28:04,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:28:08,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:28:13,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:28:17,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:28:19,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:28:24,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:28:28,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:28:33,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:28:35,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:28:39,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:28:43,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:28:46,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:28:50,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:28:54,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:29:00,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:29:04,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:29:08,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:29:11,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:29:15,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:29:19,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:29:21,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:29:26,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:29:30,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:29:36,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:29:40,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:29:44,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:29:48,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:29:52,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:29:54,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:29:59,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:30:05,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:30:08,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:30:10,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:30:14,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:30:18,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:30:23,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:30:28,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:30:32,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:30:37,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:30:41,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:30:46,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:30:50,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:30:54,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:30:58,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:31:03,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:31:04,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:31:09,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:31:11,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:31:16,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:31:21,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:31:21,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 142 [2023-11-28 20:31:21,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 121 transitions, 453 flow. Second operand has 73 states, 73 states have (on average 30.013698630136986) internal successors, (2191), 73 states have internal predecessors, (2191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:31:21,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:31:21,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 142 [2023-11-28 20:31:21,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:31:33,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:31:37,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:31:41,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.88s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:31:45,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:31:49,428 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int#4| |c_~#queue~0.base|)) (.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse21 (select .cse0 .cse2)) (.cse41 (select .cse15 .cse4))) (let ((.cse6 (* .cse41 4)) (.cse12 (* .cse21 4))) (let ((.cse3 (+ .cse21 1)) (.cse11 (= .cse21 20)) (.cse22 (+ .cse12 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse16 (+ .cse6 |c_~#queue~0.offset|)) (.cse26 (+ 88 |c_~#queue~0.offset|)) (.cse5 (select |c_#length| |c_~#queue~0.base|)) (.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= (+ (* (select (select (store |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 .cse3)) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) .cse5)) (<= (+ .cse6 |c_~#queue~0.offset| 4) .cse5) (or (and (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (let ((.cse7 (select (store |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 .cse3)) |c_~#queue~0.base|))) (let ((.cse8 (+ (* (select .cse7 .cse4) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_708 Int)) (<= 0 (+ (* (select (store .cse7 .cse8 v_ArrVal_708) .cse4) 4) |c_~#queue~0.offset| 4))) (< .cse8 0))))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (let ((.cse9 (select (store |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 .cse3)) |c_~#queue~0.base|))) (let ((.cse10 (+ (* (select .cse9 .cse4) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_708 Int)) (<= (+ (* (select (store .cse9 .cse10 v_ArrVal_708) .cse4) 4) |c_~#queue~0.offset| 8) .cse5)) (< .cse10 0)))))) .cse11) (<= (+ .cse12 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (let ((.cse13 (select (store |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse2 .cse3)) |c_~#queue~0.base|))) (let ((.cse14 (+ (* (select .cse13 .cse4) 4) |c_~#queue~0.offset|))) (or (and (forall ((v_ArrVal_708 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (store .cse13 .cse14 v_ArrVal_708) .cse4) 4) 4))) (forall ((v_ArrVal_708 Int)) (<= (+ |c_~#queue~0.offset| 8 (* (select (store .cse13 .cse14 v_ArrVal_708) .cse4) 4)) .cse5))) (< .cse14 0) .cse11))) (or (and (forall ((v_ArrVal_708 Int)) (<= 0 (+ |c_~#queue~0.offset| 4 (* 4 (select (store .cse15 .cse16 v_ArrVal_708) .cse4))))) (forall ((v_ArrVal_708 Int)) (<= (+ |c_~#queue~0.offset| 8 (* 4 (select (store .cse15 .cse16 v_ArrVal_708) .cse4))) .cse5))) (< .cse16 0)) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= 0 (+ (* (select (select (store |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 .cse3)) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (or (forall ((v_ArrVal_704 Int)) (let ((.cse20 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_704))) (let ((.cse17 (select .cse20 .cse2))) (or (= .cse17 20) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (let ((.cse19 (select (store |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse20 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ .cse17 1))) |c_~#queue~0.base|))) (let ((.cse18 (+ (* (select .cse19 .cse4) 4) |c_~#queue~0.offset|))) (or (< .cse18 0) (forall ((v_ArrVal_708 Int)) (<= 0 (+ (* (select (store .cse19 .cse18 v_ArrVal_708) .cse4) 4) |c_~#queue~0.offset| 4))))))))))) (< .cse21 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|))) (<= 0 .cse22) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_708 Int) (v_ArrVal_704 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int) (v_ArrVal_701 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_47| Int)) (let ((.cse23 (select (store |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 v_ArrVal_701)) |c_~#queue~0.base|))) (let ((.cse25 (store .cse23 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_704))) (let ((.cse24 (select .cse25 .cse4))) (let ((.cse27 (+ (* 4 .cse24) |c_~#queue~0.offset| 4))) (or (< .cse3 v_ArrVal_701) (< (select .cse23 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) (= 20 .cse24) (< (+ (* (select (store (store (store .cse25 .cse26 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_47| 1)) .cse4 (+ .cse24 1)) .cse27 v_ArrVal_708) .cse4) 4) 7 |c_~#queue~0.offset|) .cse5) (< .cse27 0))))))) .cse11) (or (< .cse22 0) (and (forall ((v_ArrVal_708 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= (+ (* (select (select (store |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse28 (store .cse0 .cse22 v_ArrVal_708))) (store (store .cse28 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse28 .cse2) 1)))) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) .cse5)) (forall ((v_ArrVal_708 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= 0 (+ (* (select (select (store |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse29 (store .cse0 .cse22 v_ArrVal_708))) (store (store .cse29 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse29 .cse2) 1)))) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))))) (<= 0 .cse16) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int)) (or (< .cse21 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_708 Int) (v_ArrVal_704 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int) (v_ArrVal_701 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_47| Int) (v_ArrVal_699 Int)) (let ((.cse35 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_699))) (let ((.cse34 (select (store |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse35 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 v_ArrVal_701)) |c_~#queue~0.base|))) (let ((.cse32 (store .cse34 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_704))) (let ((.cse30 (select .cse32 .cse4))) (let ((.cse33 (+ (* 4 .cse30) |c_~#queue~0.offset| 4)) (.cse31 (select .cse35 .cse2))) (or (= 20 .cse30) (= .cse31 20) (< (+ 7 |c_~#queue~0.offset| (* (select (store (store (store .cse32 .cse26 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_47| 1)) .cse4 (+ .cse30 1)) .cse33 v_ArrVal_708) .cse4) 4)) .cse5) (< .cse33 0) (< (select .cse34 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) (< (+ .cse31 1) v_ArrVal_701)))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_708 Int) (v_ArrVal_704 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int) (v_ArrVal_701 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_47| Int) (v_ArrVal_699 Int)) (let ((.cse38 (store .cse15 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_699)) (.cse39 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)))) (let ((.cse40 (select (store (store (store .cse38 .cse26 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 v_ArrVal_701) .cse39 v_ArrVal_704) .cse4))) (let ((.cse36 (+ |c_~#queue~0.offset| (* 4 .cse40) 4)) (.cse37 (select .cse38 .cse4))) (or (< .cse36 0) (< v_ArrVal_701 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) (< (+ .cse37 1) v_ArrVal_701) (< (+ 7 (* (select (store (store (store (store .cse38 .cse39 v_ArrVal_704) .cse26 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_47| 1)) .cse4 (+ 1 .cse40)) .cse36 v_ArrVal_708) .cse4) 4) |c_~#queue~0.offset|) .cse5) (< .cse41 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) (= 20 .cse40) (= 20 .cse37)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (or (forall ((v_ArrVal_704 Int)) (let ((.cse45 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_704))) (let ((.cse42 (select .cse45 .cse2))) (or (= .cse42 20) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (let ((.cse44 (select (store |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse45 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ .cse42 1))) |c_~#queue~0.base|))) (let ((.cse43 (+ (* (select .cse44 .cse4) 4) |c_~#queue~0.offset|))) (or (< .cse43 0) (forall ((v_ArrVal_708 Int)) (<= (+ (* (select (store .cse44 .cse43 v_ArrVal_708) .cse4) 4) |c_~#queue~0.offset| 8) .cse5)))))))))) (< .cse21 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)))))))) is different from false [2023-11-28 20:32:49,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:32:53,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:32:57,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:33:01,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:33:05,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:33:09,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:33:13,813 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int#4| |c_~#queue~0.base|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse9 (select .cse3 .cse5))) (let ((.cse0 (* .cse9 4))) (let ((.cse4 (+ .cse0 |c_~#queue~0.offset|)) (.cse2 (* (select (select (store |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse10 (select |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse10 .cse11 (+ (select .cse10 .cse11) 1)))) |c_~#queue~0.base|) .cse5) 4)) (.cse1 (select |c_#length| |c_~#queue~0.base|))) (and (<= (+ .cse0 |c_~#queue~0.offset| 4) .cse1) (<= (+ .cse2 |c_~#queue~0.offset| 4) .cse1) (or (and (forall ((v_ArrVal_708 Int)) (<= 0 (+ |c_~#queue~0.offset| 4 (* 4 (select (store .cse3 .cse4 v_ArrVal_708) .cse5))))) (forall ((v_ArrVal_708 Int)) (<= (+ |c_~#queue~0.offset| 8 (* 4 (select (store .cse3 .cse4 v_ArrVal_708) .cse5))) .cse1))) (< .cse4 0)) (<= 0 .cse4) (<= 0 (+ .cse2 |c_~#queue~0.offset|)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (or (forall ((v_ArrVal_704 Int)) (let ((.cse8 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_704))) (let ((.cse7 (select .cse8 .cse5))) (let ((.cse6 (+ (* .cse7 4) |c_~#queue~0.offset| 4))) (or (< .cse6 0) (= .cse7 20) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_708 Int)) (<= (+ (* (select (store (store (store .cse8 (+ 88 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 (+ .cse7 1)) .cse6 v_ArrVal_708) .cse5) 4) |c_~#queue~0.offset| 8) .cse1))))))) (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)))))))) is different from false [2023-11-28 20:33:17,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:33:21,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:33:25,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:33:30,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:33:34,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:33:38,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:33:42,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:33:46,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:33:50,111 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (select .cse8 .cse7))) (let ((.cse0 (* .cse9 4))) (let ((.cse10 (+ .cse0 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse12 (select |c_#length| |c_~#queue~0.base|)) (.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (<= (+ .cse0 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (or (forall ((v_ArrVal_704 Int)) (let ((.cse5 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_704))) (let ((.cse1 (select .cse5 .cse7))) (or (= .cse1 20) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (let ((.cse3 (select (store |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ .cse1 1))) |c_~#queue~0.base|))) (let ((.cse2 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|))) (or (< .cse2 0) (forall ((v_ArrVal_708 Int)) (<= 0 (+ (* (select (store .cse3 .cse2 v_ArrVal_708) .cse4) 4) |c_~#queue~0.offset| 4))))))))))) (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|))) (<= 0 .cse10) (or (< .cse10 0) (and (forall ((v_ArrVal_708 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= (+ (* (select (select (store |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (store .cse8 .cse10 v_ArrVal_708))) (store (store .cse11 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse11 .cse7) 1)))) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) .cse12)) (forall ((v_ArrVal_708 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= 0 (+ (* (select (select (store |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (store .cse8 .cse10 v_ArrVal_708))) (store (store .cse13 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse13 .cse7) 1)))) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (or (forall ((v_ArrVal_704 Int)) (let ((.cse17 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_704))) (let ((.cse14 (select .cse17 .cse7))) (or (= .cse14 20) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (let ((.cse16 (select (store |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse17 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ .cse14 1))) |c_~#queue~0.base|))) (let ((.cse15 (+ (* (select .cse16 .cse4) 4) |c_~#queue~0.offset|))) (or (< .cse15 0) (forall ((v_ArrVal_708 Int)) (<= (+ (* (select (store .cse16 .cse15 v_ArrVal_708) .cse4) 4) |c_~#queue~0.offset| 8) .cse12)))))))))) (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)))))))) is different from false [2023-11-28 20:33:54,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:33:58,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.93s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:34:02,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:34:40,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:34:44,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:34:48,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:34:52,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:34:54,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:34:58,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:35:02,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:35:06,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:35:10,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:35:14,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:35:18,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:35:22,833 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int#4| |c_~#queue~0.base|)) (.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse14 (select .cse0 .cse2)) (.cse25 (select .cse8 .cse4))) (let ((.cse6 (* .cse25 4)) (.cse7 (* .cse14 4))) (let ((.cse3 (+ .cse14 1)) (.cse15 (+ .cse7 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse9 (+ .cse6 |c_~#queue~0.offset|)) (.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (select |c_#length| |c_~#queue~0.base|))) (and (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= (+ (* (select (select (store |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 .cse3)) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) .cse5)) (<= (+ .cse6 |c_~#queue~0.offset| 4) .cse5) (<= (+ .cse7 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (or (and (forall ((v_ArrVal_708 Int)) (<= 0 (+ |c_~#queue~0.offset| 4 (* 4 (select (store .cse8 .cse9 v_ArrVal_708) .cse4))))) (forall ((v_ArrVal_708 Int)) (<= (+ |c_~#queue~0.offset| 8 (* 4 (select (store .cse8 .cse9 v_ArrVal_708) .cse4))) .cse5))) (< .cse9 0)) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= 0 (+ (* (select (select (store |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 .cse3)) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (or (forall ((v_ArrVal_704 Int)) (let ((.cse13 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_704))) (let ((.cse10 (select .cse13 .cse2))) (or (= .cse10 20) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (let ((.cse12 (select (store |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse13 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ .cse10 1))) |c_~#queue~0.base|))) (let ((.cse11 (+ (* (select .cse12 .cse4) 4) |c_~#queue~0.offset|))) (or (< .cse11 0) (forall ((v_ArrVal_708 Int)) (<= 0 (+ (* (select (store .cse12 .cse11 v_ArrVal_708) .cse4) 4) |c_~#queue~0.offset| 4))))))))))) (< .cse14 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|))) (<= 0 .cse15) (or (< .cse15 0) (and (forall ((v_ArrVal_708 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= (+ (* (select (select (store |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse16 (store .cse0 .cse15 v_ArrVal_708))) (store (store .cse16 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse16 .cse2) 1)))) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) .cse5)) (forall ((v_ArrVal_708 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= 0 (+ (* (select (select (store |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse17 (store .cse0 .cse15 v_ArrVal_708))) (store (store .cse17 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse17 .cse2) 1)))) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))))) (<= 0 .cse9) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (or (forall ((v_ArrVal_704 Int)) (let ((.cse21 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_704))) (let ((.cse18 (select .cse21 .cse2))) (or (= .cse18 20) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (let ((.cse20 (select (store |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse21 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ .cse18 1))) |c_~#queue~0.base|))) (let ((.cse19 (+ (* (select .cse20 .cse4) 4) |c_~#queue~0.offset|))) (or (< .cse19 0) (forall ((v_ArrVal_708 Int)) (<= (+ (* (select (store .cse20 .cse19 v_ArrVal_708) .cse4) 4) |c_~#queue~0.offset| 8) .cse5)))))))))) (< .cse14 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (or (forall ((v_ArrVal_704 Int)) (let ((.cse24 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_704))) (let ((.cse23 (select .cse24 .cse4))) (let ((.cse22 (+ (* .cse23 4) |c_~#queue~0.offset| 4))) (or (< .cse22 0) (= .cse23 20) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_708 Int)) (<= (+ (* (select (store (store (store .cse24 (+ 88 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ .cse23 1)) .cse22 v_ArrVal_708) .cse4) 4) |c_~#queue~0.offset| 8) .cse5))))))) (< .cse25 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)))))))) is different from false [2023-11-28 20:35:26,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]