./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/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_323a1e17-95cb-4e2b-997f-54a01b261a26/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/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_323a1e17-95cb-4e2b-997f-54a01b261a26/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 f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:54:49,102 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:54:49,168 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 00:54:49,173 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:54:49,174 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:54:49,199 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:54:49,199 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:54:49,200 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:54:49,201 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:54:49,201 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:54:49,202 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:54:49,202 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:54:49,203 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:54:49,203 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:54:49,204 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:54:49,204 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:54:49,205 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:54:49,205 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:54:49,206 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:54:49,206 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:54:49,206 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 00:54:49,211 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 00:54:49,211 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 00:54:49,211 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:54:49,212 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 00:54:49,212 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:54:49,213 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:54:49,213 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:54:49,213 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:54:49,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:54:49,214 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:54:49,214 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:54:49,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:54:49,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:54:49,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:54:49,216 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:54:49,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:54:49,216 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:54:49,217 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:54:49,217 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:54:49,218 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:54:49,219 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_323a1e17-95cb-4e2b-997f-54a01b261a26/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_323a1e17-95cb-4e2b-997f-54a01b261a26/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 -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2023-11-29 00:54:49,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:54:49,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:54:49,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:54:49,493 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:54:49,494 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:54:49,495 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2023-11-29 00:54:52,324 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:54:52,572 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:54:52,573 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/sv-benchmarks/c/pthread/queue_ok_longer.i [2023-11-29 00:54:52,591 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/bin/uautomizer-verify-BQ2R08f2Ya/data/4bdb42b6b/f1dc08e2701d425ba376119a16c406b8/FLAGa42a16b2a [2023-11-29 00:54:52,606 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/bin/uautomizer-verify-BQ2R08f2Ya/data/4bdb42b6b/f1dc08e2701d425ba376119a16c406b8 [2023-11-29 00:54:52,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:54:52,610 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:54:52,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:54:52,612 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:54:52,617 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:54:52,618 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:54:52" (1/1) ... [2023-11-29 00:54:52,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40ceaa38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:54:52, skipping insertion in model container [2023-11-29 00:54:52,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:54:52" (1/1) ... [2023-11-29 00:54:52,674 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:54:53,071 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:54:53,081 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:54:53,130 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:54:53,185 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:54:53,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:54:53 WrapperNode [2023-11-29 00:54:53,185 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:54:53,186 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:54:53,186 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:54:53,186 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:54:53,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:54:53" (1/1) ... [2023-11-29 00:54:53,212 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:54:53" (1/1) ... [2023-11-29 00:54:53,241 INFO L138 Inliner]: procedures = 275, calls = 61, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 214 [2023-11-29 00:54:53,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:54:53,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:54:53,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:54:53,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:54:53,254 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:54:53" (1/1) ... [2023-11-29 00:54:53,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:54:53" (1/1) ... [2023-11-29 00:54:53,260 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:54:53" (1/1) ... [2023-11-29 00:54:53,281 INFO L175 MemorySlicer]: Split 38 memory accesses to 6 slices as follows [2, 2, 5, 3, 2, 24]. 63 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5, 0, 0, 0]. The 15 writes are split as follows [0, 1, 0, 2, 1, 11]. [2023-11-29 00:54:53,282 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:54:53" (1/1) ... [2023-11-29 00:54:53,282 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:54:53" (1/1) ... [2023-11-29 00:54:53,296 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:54:53" (1/1) ... [2023-11-29 00:54:53,300 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:54:53" (1/1) ... [2023-11-29 00:54:53,304 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:54:53" (1/1) ... [2023-11-29 00:54:53,306 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:54:53" (1/1) ... [2023-11-29 00:54:53,312 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:54:53,312 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:54:53,313 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:54:53,313 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:54:53,313 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:54:53" (1/1) ... [2023-11-29 00:54:53,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:54:53,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:54:53,348 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:54:53,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:54:53,387 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-29 00:54:53,388 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-29 00:54:53,388 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-29 00:54:53,388 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-29 00:54:53,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:54:53,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:54:53,388 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-29 00:54:53,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 00:54:53,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 00:54:53,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 00:54:53,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 00:54:53,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 00:54:53,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-29 00:54:53,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 00:54:53,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 00:54:53,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 00:54:53,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 00:54:53,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 00:54:53,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-29 00:54:53,390 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-29 00:54:53,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:54:53,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:54:53,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 00:54:53,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 00:54:53,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 00:54:53,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 00:54:53,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-29 00:54:53,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:54:53,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:54:53,394 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 00:54:53,557 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:54:53,559 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:54:54,027 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:54:54,200 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:54:54,200 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 00:54:54,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:54:54 BoogieIcfgContainer [2023-11-29 00:54:54,201 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:54:54,203 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:54:54,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:54:54,205 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:54:54,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:54:52" (1/3) ... [2023-11-29 00:54:54,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd5512b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:54:54, skipping insertion in model container [2023-11-29 00:54:54,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:54:53" (2/3) ... [2023-11-29 00:54:54,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd5512b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:54:54, skipping insertion in model container [2023-11-29 00:54:54,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:54:54" (3/3) ... [2023-11-29 00:54:54,208 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2023-11-29 00:54:54,223 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:54:54,223 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2023-11-29 00:54:54,224 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 00:54:54,312 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-29 00:54:54,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 142 transitions, 298 flow [2023-11-29 00:54:54,410 INFO L124 PetriNetUnfolderBase]: 11/140 cut-off events. [2023-11-29 00:54:54,410 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 00:54:54,416 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-29 00:54:54,416 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 142 transitions, 298 flow [2023-11-29 00:54:54,423 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 139 transitions, 290 flow [2023-11-29 00:54:54,433 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:54:54,438 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;@6e974400, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:54:54,439 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2023-11-29 00:54:54,441 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:54:54,441 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 00:54:54,441 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:54:54,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:54:54,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 00:54:54,442 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-29 00:54:54,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:54:54,447 INFO L85 PathProgramCache]: Analyzing trace with hash 18931, now seen corresponding path program 1 times [2023-11-29 00:54:54,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:54:54,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764869316] [2023-11-29 00:54:54,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:54:54,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:54:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:54:54,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:54:54,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:54:54,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764869316] [2023-11-29 00:54:54,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764869316] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:54:54,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:54:54,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:54:54,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48157773] [2023-11-29 00:54:54,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:54:54,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:54:54,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:54:54,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:54:54,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:54:54,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 142 [2023-11-29 00:54:54,934 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-29 00:54:54,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:54:54,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 142 [2023-11-29 00:54:54,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:54:55,468 INFO L124 PetriNetUnfolderBase]: 1079/2979 cut-off events. [2023-11-29 00:54:55,468 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-11-29 00:54:55,478 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-29 00:54:55,502 INFO L140 encePairwiseOnDemand]: 134/142 looper letters, 49 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2023-11-29 00:54:55,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 127 transitions, 368 flow [2023-11-29 00:54:55,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:54:55,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:54:55,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2023-11-29 00:54:55,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6971830985915493 [2023-11-29 00:54:55,518 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 297 transitions. [2023-11-29 00:54:55,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 297 transitions. [2023-11-29 00:54:55,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:54:55,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 297 transitions. [2023-11-29 00:54:55,526 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-29 00:54:55,531 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-29 00:54:55,532 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-29 00:54:55,534 INFO L175 Difference]: Start difference. First operand has 135 places, 139 transitions, 290 flow. Second operand 3 states and 297 transitions. [2023-11-29 00:54:55,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 127 transitions, 368 flow [2023-11-29 00:54:55,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 127 transitions, 360 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 00:54:55,544 INFO L231 Difference]: Finished difference. Result has 125 places, 127 transitions, 262 flow [2023-11-29 00:54:55,546 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-29 00:54:55,550 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -10 predicate places. [2023-11-29 00:54:55,550 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 127 transitions, 262 flow [2023-11-29 00:54:55,551 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-29 00:54:55,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:54:55,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 00:54:55,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:54:55,551 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-29 00:54:55,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:54:55,552 INFO L85 PathProgramCache]: Analyzing trace with hash 18932, now seen corresponding path program 1 times [2023-11-29 00:54:55,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:54:55,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774301071] [2023-11-29 00:54:55,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:54:55,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:54:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:54:55,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:54:55,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:54:55,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774301071] [2023-11-29 00:54:55,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774301071] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:54:55,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:54:55,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:54:55,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572576337] [2023-11-29 00:54:55,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:54:55,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:54:55,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:54:55,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:54:55,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:54:55,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 142 [2023-11-29 00:54:55,817 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-29 00:54:55,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:54:55,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 142 [2023-11-29 00:54:55,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:54:56,279 INFO L124 PetriNetUnfolderBase]: 1079/2976 cut-off events. [2023-11-29 00:54:56,280 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-29 00:54:56,287 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-29 00:54:56,309 INFO L140 encePairwiseOnDemand]: 137/142 looper letters, 47 selfloop transitions, 2 changer transitions 0/124 dead transitions. [2023-11-29 00:54:56,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 124 transitions, 354 flow [2023-11-29 00:54:56,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:54:56,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:54:56,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2023-11-29 00:54:56,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6995305164319249 [2023-11-29 00:54:56,313 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 298 transitions. [2023-11-29 00:54:56,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 298 transitions. [2023-11-29 00:54:56,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:54:56,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 298 transitions. [2023-11-29 00:54:56,315 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-29 00:54:56,317 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-29 00:54:56,318 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-29 00:54:56,318 INFO L175 Difference]: Start difference. First operand has 125 places, 127 transitions, 262 flow. Second operand 3 states and 298 transitions. [2023-11-29 00:54:56,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 124 transitions, 354 flow [2023-11-29 00:54:56,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 124 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:54:56,322 INFO L231 Difference]: Finished difference. Result has 122 places, 124 transitions, 256 flow [2023-11-29 00:54:56,323 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-29 00:54:56,324 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -13 predicate places. [2023-11-29 00:54:56,324 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 124 transitions, 256 flow [2023-11-29 00:54:56,324 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-29 00:54:56,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:54:56,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 00:54:56,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:54:56,325 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-29 00:54:56,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:54:56,326 INFO L85 PathProgramCache]: Analyzing trace with hash 564545759, now seen corresponding path program 1 times [2023-11-29 00:54:56,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:54:56,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877993783] [2023-11-29 00:54:56,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:54:56,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:54:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:54:56,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:54:56,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:54:56,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877993783] [2023-11-29 00:54:56,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877993783] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:54:56,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:54:56,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:54:56,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124917021] [2023-11-29 00:54:56,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:54:56,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:54:56,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:54:56,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:54:56,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:54:56,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 142 [2023-11-29 00:54:56,614 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-29 00:54:56,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:54:56,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 142 [2023-11-29 00:54:56,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:54:57,032 INFO L124 PetriNetUnfolderBase]: 1079/2974 cut-off events. [2023-11-29 00:54:57,032 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-29 00:54:57,038 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-29 00:54:57,060 INFO L140 encePairwiseOnDemand]: 137/142 looper letters, 49 selfloop transitions, 3 changer transitions 0/122 dead transitions. [2023-11-29 00:54:57,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 122 transitions, 356 flow [2023-11-29 00:54:57,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:54:57,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 00:54:57,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 362 transitions. [2023-11-29 00:54:57,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6373239436619719 [2023-11-29 00:54:57,063 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 362 transitions. [2023-11-29 00:54:57,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 362 transitions. [2023-11-29 00:54:57,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:54:57,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 362 transitions. [2023-11-29 00:54:57,065 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-29 00:54:57,067 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-29 00:54:57,068 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-29 00:54:57,068 INFO L175 Difference]: Start difference. First operand has 122 places, 124 transitions, 256 flow. Second operand 4 states and 362 transitions. [2023-11-29 00:54:57,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 122 transitions, 356 flow [2023-11-29 00:54:57,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 122 transitions, 352 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:54:57,073 INFO L231 Difference]: Finished difference. Result has 121 places, 122 transitions, 254 flow [2023-11-29 00:54:57,073 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-29 00:54:57,074 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -14 predicate places. [2023-11-29 00:54:57,074 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 122 transitions, 254 flow [2023-11-29 00:54:57,075 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-29 00:54:57,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:54:57,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 00:54:57,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:54:57,075 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-29 00:54:57,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:54:57,076 INFO L85 PathProgramCache]: Analyzing trace with hash 564545760, now seen corresponding path program 1 times [2023-11-29 00:54:57,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:54:57,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134277656] [2023-11-29 00:54:57,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:54:57,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:54:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:54:57,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:54:57,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:54:57,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134277656] [2023-11-29 00:54:57,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134277656] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:54:57,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:54:57,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:54:57,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749864976] [2023-11-29 00:54:57,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:54:57,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:54:57,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:54:57,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:54:57,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:54:57,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 142 [2023-11-29 00:54:57,339 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-29 00:54:57,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:54:57,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 142 [2023-11-29 00:54:57,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:54:57,654 INFO L124 PetriNetUnfolderBase]: 1079/2972 cut-off events. [2023-11-29 00:54:57,654 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-29 00:54:57,659 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-29 00:54:57,679 INFO L140 encePairwiseOnDemand]: 137/142 looper letters, 46 selfloop transitions, 3 changer transitions 0/120 dead transitions. [2023-11-29 00:54:57,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 120 transitions, 348 flow [2023-11-29 00:54:57,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:54:57,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 00:54:57,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 383 transitions. [2023-11-29 00:54:57,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6742957746478874 [2023-11-29 00:54:57,682 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 383 transitions. [2023-11-29 00:54:57,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 383 transitions. [2023-11-29 00:54:57,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:54:57,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 383 transitions. [2023-11-29 00:54:57,684 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-29 00:54:57,700 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-29 00:54:57,701 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-29 00:54:57,701 INFO L175 Difference]: Start difference. First operand has 121 places, 122 transitions, 254 flow. Second operand 4 states and 383 transitions. [2023-11-29 00:54:57,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 120 transitions, 348 flow [2023-11-29 00:54:57,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 120 transitions, 342 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 00:54:57,705 INFO L231 Difference]: Finished difference. Result has 119 places, 120 transitions, 250 flow [2023-11-29 00:54:57,705 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-29 00:54:57,706 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -16 predicate places. [2023-11-29 00:54:57,706 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 120 transitions, 250 flow [2023-11-29 00:54:57,707 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-29 00:54:57,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:54:57,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:54:57,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:54:57,708 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-29 00:54:57,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:54:57,708 INFO L85 PathProgramCache]: Analyzing trace with hash -495210249, now seen corresponding path program 1 times [2023-11-29 00:54:57,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:54:57,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421306000] [2023-11-29 00:54:57,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:54:57,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:54:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:54:57,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:54:57,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:54:57,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421306000] [2023-11-29 00:54:57,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421306000] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:54:57,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:54:57,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:54:57,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174970560] [2023-11-29 00:54:57,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:54:57,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:54:57,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:54:57,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:54:57,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:54:57,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 142 [2023-11-29 00:54:57,873 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-29 00:54:57,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:54:57,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 142 [2023-11-29 00:54:57,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:54:58,330 INFO L124 PetriNetUnfolderBase]: 1736/4461 cut-off events. [2023-11-29 00:54:58,331 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-29 00:54:58,337 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-29 00:54:58,361 INFO L140 encePairwiseOnDemand]: 138/142 looper letters, 49 selfloop transitions, 2 changer transitions 0/118 dead transitions. [2023-11-29 00:54:58,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 118 transitions, 348 flow [2023-11-29 00:54:58,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:54:58,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:54:58,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-11-29 00:54:58,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6948356807511737 [2023-11-29 00:54:58,363 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-11-29 00:54:58,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-11-29 00:54:58,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:54:58,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-11-29 00:54:58,365 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-29 00:54:58,366 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-29 00:54:58,367 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-29 00:54:58,367 INFO L175 Difference]: Start difference. First operand has 119 places, 120 transitions, 250 flow. Second operand 3 states and 296 transitions. [2023-11-29 00:54:58,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 118 transitions, 348 flow [2023-11-29 00:54:58,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 118 transitions, 342 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 00:54:58,370 INFO L231 Difference]: Finished difference. Result has 116 places, 118 transitions, 244 flow [2023-11-29 00:54:58,370 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-29 00:54:58,371 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -19 predicate places. [2023-11-29 00:54:58,371 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 118 transitions, 244 flow [2023-11-29 00:54:58,372 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-29 00:54:58,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:54:58,372 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:54:58,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:54:58,372 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-29 00:54:58,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:54:58,373 INFO L85 PathProgramCache]: Analyzing trace with hash -495210248, now seen corresponding path program 1 times [2023-11-29 00:54:58,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:54:58,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227084722] [2023-11-29 00:54:58,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:54:58,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:54:58,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:54:58,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:54:58,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:54:58,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227084722] [2023-11-29 00:54:58,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227084722] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:54:58,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:54:58,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:54:58,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669678843] [2023-11-29 00:54:58,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:54:58,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:54:58,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:54:58,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:54:58,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:54:58,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 142 [2023-11-29 00:54:58,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 118 transitions, 244 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-29 00:54:58,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:54:58,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 142 [2023-11-29 00:54:58,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:54:58,998 INFO L124 PetriNetUnfolderBase]: 1736/4455 cut-off events. [2023-11-29 00:54:58,998 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-29 00:54:59,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7129 conditions, 4455 events. 1736/4455 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 36994 event pairs, 1369 based on Foata normal form. 0/3152 useless extension candidates. Maximal degree in co-relation 7119. Up to 2653 conditions per place. [2023-11-29 00:54:59,015 INFO L140 encePairwiseOnDemand]: 138/142 looper letters, 49 selfloop transitions, 2 changer transitions 0/116 dead transitions. [2023-11-29 00:54:59,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 116 transitions, 342 flow [2023-11-29 00:54:59,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:54:59,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:54:59,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-11-29 00:54:59,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6948356807511737 [2023-11-29 00:54:59,017 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-11-29 00:54:59,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-11-29 00:54:59,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:54:59,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-11-29 00:54:59,019 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-29 00:54:59,020 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-29 00:54:59,020 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-29 00:54:59,020 INFO L175 Difference]: Start difference. First operand has 116 places, 118 transitions, 244 flow. Second operand 3 states and 296 transitions. [2023-11-29 00:54:59,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 116 transitions, 342 flow [2023-11-29 00:54:59,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 116 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:54:59,023 INFO L231 Difference]: Finished difference. Result has 114 places, 116 transitions, 240 flow [2023-11-29 00:54:59,023 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-29 00:54:59,024 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -21 predicate places. [2023-11-29 00:54:59,024 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 116 transitions, 240 flow [2023-11-29 00:54:59,024 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-29 00:54:59,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:54:59,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:54:59,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:54:59,025 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-29 00:54:59,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:54:59,026 INFO L85 PathProgramCache]: Analyzing trace with hash 404867781, now seen corresponding path program 1 times [2023-11-29 00:54:59,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:54:59,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442146378] [2023-11-29 00:54:59,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:54:59,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:54:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:54:59,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:54:59,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:54:59,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442146378] [2023-11-29 00:54:59,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442146378] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:54:59,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:54:59,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:54:59,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329124540] [2023-11-29 00:54:59,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:54:59,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:54:59,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:54:59,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:54:59,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:54:59,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 142 [2023-11-29 00:54:59,150 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-29 00:54:59,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:54:59,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 142 [2023-11-29 00:54:59,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:54:59,419 INFO L124 PetriNetUnfolderBase]: 1120/3057 cut-off events. [2023-11-29 00:54:59,420 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-29 00:54:59,423 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-29 00:54:59,431 INFO L140 encePairwiseOnDemand]: 138/142 looper letters, 49 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2023-11-29 00:54:59,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 114 transitions, 338 flow [2023-11-29 00:54:59,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:54:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:54:59,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-11-29 00:54:59,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6948356807511737 [2023-11-29 00:54:59,433 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-11-29 00:54:59,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-11-29 00:54:59,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:54:59,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-11-29 00:54:59,435 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-29 00:54:59,436 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-29 00:54:59,437 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-29 00:54:59,437 INFO L175 Difference]: Start difference. First operand has 114 places, 116 transitions, 240 flow. Second operand 3 states and 296 transitions. [2023-11-29 00:54:59,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 114 transitions, 338 flow [2023-11-29 00:54:59,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 114 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:54:59,440 INFO L231 Difference]: Finished difference. Result has 112 places, 114 transitions, 236 flow [2023-11-29 00:54:59,441 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-29 00:54:59,441 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -23 predicate places. [2023-11-29 00:54:59,442 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 114 transitions, 236 flow [2023-11-29 00:54:59,442 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-29 00:54:59,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:54:59,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:54:59,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:54:59,442 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-29 00:54:59,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:54:59,443 INFO L85 PathProgramCache]: Analyzing trace with hash 404867782, now seen corresponding path program 1 times [2023-11-29 00:54:59,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:54:59,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838279717] [2023-11-29 00:54:59,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:54:59,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:54:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:54:59,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:54:59,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:54:59,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838279717] [2023-11-29 00:54:59,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838279717] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:54:59,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:54:59,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:54:59,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046485855] [2023-11-29 00:54:59,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:54:59,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:54:59,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:54:59,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:54:59,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:54:59,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 142 [2023-11-29 00:54:59,602 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-29 00:54:59,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:54:59,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 142 [2023-11-29 00:54:59,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:54:59,884 INFO L124 PetriNetUnfolderBase]: 1079/2938 cut-off events. [2023-11-29 00:54:59,884 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-29 00:54:59,887 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-29 00:54:59,895 INFO L140 encePairwiseOnDemand]: 138/142 looper letters, 47 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2023-11-29 00:54:59,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 112 transitions, 330 flow [2023-11-29 00:54:59,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:54:59,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:54:59,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2023-11-29 00:54:59,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.704225352112676 [2023-11-29 00:54:59,897 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 300 transitions. [2023-11-29 00:54:59,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 300 transitions. [2023-11-29 00:54:59,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:54:59,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 300 transitions. [2023-11-29 00:54:59,898 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-29 00:54:59,899 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-29 00:54:59,899 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-29 00:54:59,899 INFO L175 Difference]: Start difference. First operand has 112 places, 114 transitions, 236 flow. Second operand 3 states and 300 transitions. [2023-11-29 00:54:59,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 112 transitions, 330 flow [2023-11-29 00:54:59,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 112 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:54:59,902 INFO L231 Difference]: Finished difference. Result has 110 places, 112 transitions, 232 flow [2023-11-29 00:54:59,902 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-29 00:54:59,903 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -25 predicate places. [2023-11-29 00:54:59,903 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 112 transitions, 232 flow [2023-11-29 00:54:59,903 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-29 00:54:59,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:54:59,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:54:59,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 00:54:59,904 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-29 00:54:59,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:54:59,904 INFO L85 PathProgramCache]: Analyzing trace with hash -495378663, now seen corresponding path program 1 times [2023-11-29 00:54:59,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:54:59,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69991373] [2023-11-29 00:54:59,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:54:59,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:54:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:55:00,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:55:00,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:55:00,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69991373] [2023-11-29 00:55:00,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69991373] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:55:00,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:55:00,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:55:00,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824163912] [2023-11-29 00:55:00,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:55:00,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:55:00,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:55:00,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:55:00,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:55:00,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 142 [2023-11-29 00:55:00,390 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-29 00:55:00,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:55:00,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 142 [2023-11-29 00:55:00,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:55:00,811 INFO L124 PetriNetUnfolderBase]: 1078/2725 cut-off events. [2023-11-29 00:55:00,811 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-29 00:55:00,815 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-29 00:55:00,825 INFO L140 encePairwiseOnDemand]: 130/142 looper letters, 68 selfloop transitions, 5 changer transitions 0/129 dead transitions. [2023-11-29 00:55:00,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 129 transitions, 413 flow [2023-11-29 00:55:00,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:55:00,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:55:00,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 548 transitions. [2023-11-29 00:55:00,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6431924882629108 [2023-11-29 00:55:00,829 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 548 transitions. [2023-11-29 00:55:00,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 548 transitions. [2023-11-29 00:55:00,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:55:00,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 548 transitions. [2023-11-29 00:55:00,831 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-29 00:55:00,833 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-29 00:55:00,834 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-29 00:55:00,834 INFO L175 Difference]: Start difference. First operand has 110 places, 112 transitions, 232 flow. Second operand 6 states and 548 transitions. [2023-11-29 00:55:00,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 129 transitions, 413 flow [2023-11-29 00:55:00,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 129 transitions, 409 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:55:00,837 INFO L231 Difference]: Finished difference. Result has 106 places, 105 transitions, 224 flow [2023-11-29 00:55:00,837 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-29 00:55:00,838 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -29 predicate places. [2023-11-29 00:55:00,838 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 105 transitions, 224 flow [2023-11-29 00:55:00,839 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-29 00:55:00,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:55:00,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:55:00,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 00:55:00,839 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-29 00:55:00,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:55:00,840 INFO L85 PathProgramCache]: Analyzing trace with hash -495378664, now seen corresponding path program 1 times [2023-11-29 00:55:00,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:55:00,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088218063] [2023-11-29 00:55:00,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:55:00,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:55:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:55:00,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:55:00,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:55:00,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088218063] [2023-11-29 00:55:00,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088218063] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:55:00,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:55:00,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:55:00,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693071844] [2023-11-29 00:55:00,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:55:00,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:55:00,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:55:00,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:55:00,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:55:01,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 142 [2023-11-29 00:55:01,140 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-29 00:55:01,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:55:01,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 142 [2023-11-29 00:55:01,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:55:01,483 INFO L124 PetriNetUnfolderBase]: 1276/2627 cut-off events. [2023-11-29 00:55:01,483 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2023-11-29 00:55:01,486 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-29 00:55:01,495 INFO L140 encePairwiseOnDemand]: 129/142 looper letters, 73 selfloop transitions, 5 changer transitions 0/121 dead transitions. [2023-11-29 00:55:01,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 121 transitions, 413 flow [2023-11-29 00:55:01,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:55:01,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:55:01,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 431 transitions. [2023-11-29 00:55:01,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6070422535211267 [2023-11-29 00:55:01,498 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 431 transitions. [2023-11-29 00:55:01,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 431 transitions. [2023-11-29 00:55:01,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:55:01,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 431 transitions. [2023-11-29 00:55:01,500 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-29 00:55:01,502 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-29 00:55:01,502 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-29 00:55:01,502 INFO L175 Difference]: Start difference. First operand has 106 places, 105 transitions, 224 flow. Second operand 5 states and 431 transitions. [2023-11-29 00:55:01,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 121 transitions, 413 flow [2023-11-29 00:55:01,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 121 transitions, 403 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 00:55:01,506 INFO L231 Difference]: Finished difference. Result has 97 places, 97 transitions, 208 flow [2023-11-29 00:55:01,506 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-29 00:55:01,507 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -38 predicate places. [2023-11-29 00:55:01,507 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 97 transitions, 208 flow [2023-11-29 00:55:01,508 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-29 00:55:01,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:55:01,508 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:55:01,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 00:55:01,508 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-29 00:55:01,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:55:01,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1823131262, now seen corresponding path program 1 times [2023-11-29 00:55:01,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:55:01,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601572586] [2023-11-29 00:55:01,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:55:01,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:55:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:55:01,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:55:01,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:55:01,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601572586] [2023-11-29 00:55:01,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601572586] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:55:01,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:55:01,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:55:01,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411651662] [2023-11-29 00:55:01,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:55:01,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:55:01,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:55:01,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:55:01,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:55:02,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 142 [2023-11-29 00:55:02,483 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-29 00:55:02,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:55:02,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 142 [2023-11-29 00:55:02,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:55:03,218 INFO L124 PetriNetUnfolderBase]: 2060/4303 cut-off events. [2023-11-29 00:55:03,218 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2023-11-29 00:55:03,221 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-29 00:55:03,230 INFO L140 encePairwiseOnDemand]: 132/142 looper letters, 133 selfloop transitions, 12 changer transitions 0/188 dead transitions. [2023-11-29 00:55:03,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 188 transitions, 689 flow [2023-11-29 00:55:03,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:55:03,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 00:55:03,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 715 transitions. [2023-11-29 00:55:03,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6294014084507042 [2023-11-29 00:55:03,234 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 715 transitions. [2023-11-29 00:55:03,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 715 transitions. [2023-11-29 00:55:03,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:55:03,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 715 transitions. [2023-11-29 00:55:03,236 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-29 00:55:03,239 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-29 00:55:03,240 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-29 00:55:03,240 INFO L175 Difference]: Start difference. First operand has 97 places, 97 transitions, 208 flow. Second operand 8 states and 715 transitions. [2023-11-29 00:55:03,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 188 transitions, 689 flow [2023-11-29 00:55:03,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 188 transitions, 675 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 00:55:03,244 INFO L231 Difference]: Finished difference. Result has 104 places, 107 transitions, 274 flow [2023-11-29 00:55:03,244 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-29 00:55:03,245 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -31 predicate places. [2023-11-29 00:55:03,245 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 107 transitions, 274 flow [2023-11-29 00:55:03,245 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-29 00:55:03,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:55:03,246 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:55:03,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 00:55:03,246 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-29 00:55:03,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:55:03,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1765301932, now seen corresponding path program 1 times [2023-11-29 00:55:03,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:55:03,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533058566] [2023-11-29 00:55:03,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:55:03,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:55:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:55:03,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:55:03,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:55:03,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533058566] [2023-11-29 00:55:03,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533058566] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:55:03,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:55:03,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:55:03,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221473247] [2023-11-29 00:55:03,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:55:03,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:55:03,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:55:03,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:55:03,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:55:03,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 142 [2023-11-29 00:55:03,543 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-29 00:55:03,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:55:03,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 142 [2023-11-29 00:55:03,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:55:04,026 INFO L124 PetriNetUnfolderBase]: 1881/4238 cut-off events. [2023-11-29 00:55:04,026 INFO L125 PetriNetUnfolderBase]: For 314/314 co-relation queries the response was YES. [2023-11-29 00:55:04,033 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-29 00:55:04,047 INFO L140 encePairwiseOnDemand]: 135/142 looper letters, 77 selfloop transitions, 5 changer transitions 0/127 dead transitions. [2023-11-29 00:55:04,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 127 transitions, 499 flow [2023-11-29 00:55:04,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:55:04,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:55:04,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 457 transitions. [2023-11-29 00:55:04,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.643661971830986 [2023-11-29 00:55:04,050 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 457 transitions. [2023-11-29 00:55:04,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 457 transitions. [2023-11-29 00:55:04,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:55:04,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 457 transitions. [2023-11-29 00:55:04,052 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-29 00:55:04,054 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-29 00:55:04,054 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-29 00:55:04,054 INFO L175 Difference]: Start difference. First operand has 104 places, 107 transitions, 274 flow. Second operand 5 states and 457 transitions. [2023-11-29 00:55:04,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 127 transitions, 499 flow [2023-11-29 00:55:04,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 127 transitions, 495 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:55:04,060 INFO L231 Difference]: Finished difference. Result has 104 places, 105 transitions, 276 flow [2023-11-29 00:55:04,060 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-29 00:55:04,061 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -31 predicate places. [2023-11-29 00:55:04,061 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 105 transitions, 276 flow [2023-11-29 00:55:04,061 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-29 00:55:04,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:55:04,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:55:04,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 00:55:04,062 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-29 00:55:04,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:55:04,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1765301933, now seen corresponding path program 1 times [2023-11-29 00:55:04,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:55:04,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626450330] [2023-11-29 00:55:04,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:55:04,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:55:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:55:04,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:55:04,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:55:04,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626450330] [2023-11-29 00:55:04,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626450330] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:55:04,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:55:04,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:55:04,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426659893] [2023-11-29 00:55:04,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:55:04,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:55:04,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:55:04,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:55:04,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:55:04,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 142 [2023-11-29 00:55:04,142 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-29 00:55:04,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:55:04,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 142 [2023-11-29 00:55:04,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:55:04,353 INFO L124 PetriNetUnfolderBase]: 693/1675 cut-off events. [2023-11-29 00:55:04,354 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-11-29 00:55:04,355 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-29 00:55:04,358 INFO L140 encePairwiseOnDemand]: 138/142 looper letters, 62 selfloop transitions, 3 changer transitions 0/113 dead transitions. [2023-11-29 00:55:04,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 113 transitions, 415 flow [2023-11-29 00:55:04,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:55:04,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:55:04,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2023-11-29 00:55:04,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.744131455399061 [2023-11-29 00:55:04,360 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions. [2023-11-29 00:55:04,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions. [2023-11-29 00:55:04,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:55:04,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions. [2023-11-29 00:55:04,361 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-29 00:55:04,362 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-29 00:55:04,363 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-29 00:55:04,363 INFO L175 Difference]: Start difference. First operand has 104 places, 105 transitions, 276 flow. Second operand 3 states and 317 transitions. [2023-11-29 00:55:04,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 113 transitions, 415 flow [2023-11-29 00:55:04,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 113 transitions, 401 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-11-29 00:55:04,367 INFO L231 Difference]: Finished difference. Result has 101 places, 101 transitions, 255 flow [2023-11-29 00:55:04,367 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-29 00:55:04,368 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -34 predicate places. [2023-11-29 00:55:04,368 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 101 transitions, 255 flow [2023-11-29 00:55:04,368 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-29 00:55:04,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:55:04,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:55:04,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 00:55:04,369 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-29 00:55:04,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:55:04,369 INFO L85 PathProgramCache]: Analyzing trace with hash 893561673, now seen corresponding path program 1 times [2023-11-29 00:55:04,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:55:04,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59470136] [2023-11-29 00:55:04,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:55:04,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:55:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:55:04,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:55:04,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:55:04,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59470136] [2023-11-29 00:55:04,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59470136] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:55:04,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:55:04,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:55:04,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202457273] [2023-11-29 00:55:04,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:55:04,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:55:04,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:55:04,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:55:04,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:55:04,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 142 [2023-11-29 00:55:04,425 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-29 00:55:04,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:55:04,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 142 [2023-11-29 00:55:04,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:55:04,626 INFO L124 PetriNetUnfolderBase]: 572/1398 cut-off events. [2023-11-29 00:55:04,626 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2023-11-29 00:55:04,628 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-29 00:55:04,630 INFO L140 encePairwiseOnDemand]: 139/142 looper letters, 64 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2023-11-29 00:55:04,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 114 transitions, 411 flow [2023-11-29 00:55:04,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:55:04,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:55:04,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 322 transitions. [2023-11-29 00:55:04,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.755868544600939 [2023-11-29 00:55:04,632 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 322 transitions. [2023-11-29 00:55:04,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 322 transitions. [2023-11-29 00:55:04,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:55:04,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 322 transitions. [2023-11-29 00:55:04,634 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-29 00:55:04,635 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-29 00:55:04,635 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-29 00:55:04,635 INFO L175 Difference]: Start difference. First operand has 101 places, 101 transitions, 255 flow. Second operand 3 states and 322 transitions. [2023-11-29 00:55:04,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 114 transitions, 411 flow [2023-11-29 00:55:04,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 114 transitions, 403 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 00:55:04,638 INFO L231 Difference]: Finished difference. Result has 102 places, 101 transitions, 254 flow [2023-11-29 00:55:04,638 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-29 00:55:04,639 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -33 predicate places. [2023-11-29 00:55:04,639 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 101 transitions, 254 flow [2023-11-29 00:55:04,639 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-29 00:55:04,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:55:04,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:55:04,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 00:55:04,639 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-29 00:55:04,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:55:04,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1790474274, now seen corresponding path program 1 times [2023-11-29 00:55:04,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:55:04,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199767851] [2023-11-29 00:55:04,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:55:04,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:55:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:55:05,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:55:05,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:55:05,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199767851] [2023-11-29 00:55:05,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199767851] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:55:05,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:55:05,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 00:55:05,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312124968] [2023-11-29 00:55:05,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:55:05,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:55:05,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:55:05,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:55:05,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:55:05,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 142 [2023-11-29 00:55:05,365 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-29 00:55:05,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:55:05,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 142 [2023-11-29 00:55:05,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:55:05,734 INFO L124 PetriNetUnfolderBase]: 643/1459 cut-off events. [2023-11-29 00:55:05,734 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2023-11-29 00:55:05,736 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-29 00:55:05,740 INFO L140 encePairwiseOnDemand]: 132/142 looper letters, 95 selfloop transitions, 9 changer transitions 0/145 dead transitions. [2023-11-29 00:55:05,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 145 transitions, 554 flow [2023-11-29 00:55:05,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:55:05,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 00:55:05,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 824 transitions. [2023-11-29 00:55:05,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6447574334898278 [2023-11-29 00:55:05,743 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 824 transitions. [2023-11-29 00:55:05,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 824 transitions. [2023-11-29 00:55:05,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:55:05,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 824 transitions. [2023-11-29 00:55:05,747 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-29 00:55:05,749 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-29 00:55:05,750 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-29 00:55:05,750 INFO L175 Difference]: Start difference. First operand has 102 places, 101 transitions, 254 flow. Second operand 9 states and 824 transitions. [2023-11-29 00:55:05,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 145 transitions, 554 flow [2023-11-29 00:55:05,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 145 transitions, 550 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-29 00:55:05,754 INFO L231 Difference]: Finished difference. Result has 111 places, 102 transitions, 279 flow [2023-11-29 00:55:05,754 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-29 00:55:05,755 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -24 predicate places. [2023-11-29 00:55:05,755 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 102 transitions, 279 flow [2023-11-29 00:55:05,755 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-29 00:55:05,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:55:05,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:55:05,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 00:55:05,756 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-29 00:55:05,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:55:05,756 INFO L85 PathProgramCache]: Analyzing trace with hash -328796433, now seen corresponding path program 1 times [2023-11-29 00:55:05,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:55:05,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871516339] [2023-11-29 00:55:05,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:55:05,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:55:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:55:06,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:55:06,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:55:06,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871516339] [2023-11-29 00:55:06,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871516339] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:55:06,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:55:06,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:55:06,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061721800] [2023-11-29 00:55:06,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:55:06,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:55:06,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:55:06,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:55:06,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:55:06,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 142 [2023-11-29 00:55:06,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 102 transitions, 279 flow. Second operand has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:55:06,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:55:06,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 142 [2023-11-29 00:55:06,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:55:06,587 INFO L124 PetriNetUnfolderBase]: 575/1377 cut-off events. [2023-11-29 00:55:06,587 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2023-11-29 00:55:06,590 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 7578 event pairs, 395 based on Foata normal form. 12/1247 useless extension candidates. Maximal degree in co-relation 1572. Up to 786 conditions per place. [2023-11-29 00:55:06,594 INFO L140 encePairwiseOnDemand]: 137/142 looper letters, 62 selfloop transitions, 4 changer transitions 0/113 dead transitions. [2023-11-29 00:55:06,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 113 transitions, 434 flow [2023-11-29 00:55:06,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:55:06,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:55:06,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 487 transitions. [2023-11-29 00:55:06,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6859154929577465 [2023-11-29 00:55:06,597 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 487 transitions. [2023-11-29 00:55:06,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 487 transitions. [2023-11-29 00:55:06,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:55:06,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 487 transitions. [2023-11-29 00:55:06,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:55:06,601 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-29 00:55:06,601 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-29 00:55:06,601 INFO L175 Difference]: Start difference. First operand has 111 places, 102 transitions, 279 flow. Second operand 5 states and 487 transitions. [2023-11-29 00:55:06,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 113 transitions, 434 flow [2023-11-29 00:55:06,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 113 transitions, 420 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-29 00:55:06,632 INFO L231 Difference]: Finished difference. Result has 110 places, 102 transitions, 277 flow [2023-11-29 00:55:06,633 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=277, PETRI_PLACES=110, PETRI_TRANSITIONS=102} [2023-11-29 00:55:06,633 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -25 predicate places. [2023-11-29 00:55:06,633 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 102 transitions, 277 flow [2023-11-29 00:55:06,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:55:06,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:55:06,634 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:55:06,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 00:55:06,634 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-29 00:55:06,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:55:06,635 INFO L85 PathProgramCache]: Analyzing trace with hash -328796434, now seen corresponding path program 1 times [2023-11-29 00:55:06,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:55:06,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66244929] [2023-11-29 00:55:06,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:55:06,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:55:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:55:06,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:55:06,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:55:06,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66244929] [2023-11-29 00:55:06,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66244929] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:55:06,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:55:06,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:55:06,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794175654] [2023-11-29 00:55:06,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:55:06,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:55:06,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:55:06,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:55:06,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:55:06,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 142 [2023-11-29 00:55:06,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 102 transitions, 277 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-29 00:55:06,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:55:06,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 142 [2023-11-29 00:55:06,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:55:07,134 INFO L124 PetriNetUnfolderBase]: 901/1966 cut-off events. [2023-11-29 00:55:07,134 INFO L125 PetriNetUnfolderBase]: For 292/292 co-relation queries the response was YES. [2023-11-29 00:55:07,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4037 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 11083 event pairs, 837 based on Foata normal form. 34/1816 useless extension candidates. Maximal degree in co-relation 1674. Up to 1532 conditions per place. [2023-11-29 00:55:07,141 INFO L140 encePairwiseOnDemand]: 138/142 looper letters, 55 selfloop transitions, 2 changer transitions 0/100 dead transitions. [2023-11-29 00:55:07,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 100 transitions, 387 flow [2023-11-29 00:55:07,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:55:07,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:55:07,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 294 transitions. [2023-11-29 00:55:07,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6901408450704225 [2023-11-29 00:55:07,142 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 294 transitions. [2023-11-29 00:55:07,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 294 transitions. [2023-11-29 00:55:07,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:55:07,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 294 transitions. [2023-11-29 00:55:07,143 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-29 00:55:07,144 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-29 00:55:07,144 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-29 00:55:07,144 INFO L175 Difference]: Start difference. First operand has 110 places, 102 transitions, 277 flow. Second operand 3 states and 294 transitions. [2023-11-29 00:55:07,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 100 transitions, 387 flow [2023-11-29 00:55:07,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 100 transitions, 380 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 00:55:07,147 INFO L231 Difference]: Finished difference. Result has 107 places, 100 transitions, 270 flow [2023-11-29 00:55:07,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=105, 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=270, PETRI_PLACES=107, PETRI_TRANSITIONS=100} [2023-11-29 00:55:07,147 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -28 predicate places. [2023-11-29 00:55:07,148 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 100 transitions, 270 flow [2023-11-29 00:55:07,148 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-29 00:55:07,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:55:07,148 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-29 00:55:07,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 00:55:07,148 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-29 00:55:07,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:55:07,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1646577762, now seen corresponding path program 1 times [2023-11-29 00:55:07,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:55:07,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584569568] [2023-11-29 00:55:07,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:55:07,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:55:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:55:08,050 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-29 00:55:08,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:55:08,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584569568] [2023-11-29 00:55:08,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584569568] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:55:08,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418058548] [2023-11-29 00:55:08,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:55:08,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:55:08,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:55:08,054 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:55:08,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 00:55:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:55:08,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-29 00:55:08,221 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:55:08,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:55:08,371 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-29 00:55:08,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:55:08,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:55:08,662 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-29 00:55:08,704 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-29 00:55:08,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:55:08,953 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-29 00:55:08,954 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:55:30,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:55:30,917 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-29 00:55:34,986 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (store |c_#memory_int#5| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int#5| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) 0)) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select .cse0 .cse1))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (or (< 0 (+ (* (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17|)) |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1) 4) 5 |c_~#queue~0.offset|)) (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17|))) (forall ((v_prenex_2 Int) (v_prenex_1 Int)) (or (< (+ (* (select (store .cse0 (+ |c_~#queue~0.offset| (* v_prenex_1 4)) v_prenex_2) .cse1) 4) |c_~#queue~0.offset|) (+ 1605 |c_ULTIMATE.start_init_~q#1.offset|)) (< .cse2 v_prenex_1))) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|)))) is different from false [2023-11-29 00:55:35,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:55:35,035 INFO L349 Elim1Store]: treesize reduction 36, result has 53.8 percent of original size [2023-11-29 00:55:35,035 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 88 treesize of output 108 [2023-11-29 00:55:35,044 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 63 treesize of output 55 [2023-11-29 00:55:35,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:55:35,068 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 65 treesize of output 67 [2023-11-29 00:55:35,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:55:35,171 INFO L349 Elim1Store]: treesize reduction 77, result has 1.3 percent of original size [2023-11-29 00:55:35,171 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 89 treesize of output 1 [2023-11-29 00:55:35,223 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-29 00:55:35,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418058548] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:55:35,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:55:35,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 31 [2023-11-29 00:55:35,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105656954] [2023-11-29 00:55:35,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:55:35,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-29 00:55:35,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:55:35,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-29 00:55:35,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=834, Unknown=5, NotChecked=60, Total=1056 [2023-11-29 00:55:35,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 142 [2023-11-29 00:55:35,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 100 transitions, 270 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-29 00:55:35,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:55:35,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 142 [2023-11-29 00:55:35,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:55:38,530 INFO L124 PetriNetUnfolderBase]: 2548/4664 cut-off events. [2023-11-29 00:55:38,530 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2023-11-29 00:55:38,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10015 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 26323 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-29 00:55:38,566 INFO L140 encePairwiseOnDemand]: 130/142 looper letters, 250 selfloop transitions, 21 changer transitions 0/287 dead transitions. [2023-11-29 00:55:38,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 287 transitions, 1253 flow [2023-11-29 00:55:38,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 00:55:38,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-29 00:55:38,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 720 transitions. [2023-11-29 00:55:38,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31690140845070425 [2023-11-29 00:55:38,570 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 720 transitions. [2023-11-29 00:55:38,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 720 transitions. [2023-11-29 00:55:38,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:55:38,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 720 transitions. [2023-11-29 00:55:38,573 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-29 00:55:38,576 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-29 00:55:38,577 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-29 00:55:38,577 INFO L175 Difference]: Start difference. First operand has 107 places, 100 transitions, 270 flow. Second operand 16 states and 720 transitions. [2023-11-29 00:55:38,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 287 transitions, 1253 flow [2023-11-29 00:55:38,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 287 transitions, 1243 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:55:38,585 INFO L231 Difference]: Finished difference. Result has 124 places, 114 transitions, 380 flow [2023-11-29 00:55:38,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=105, 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=380, PETRI_PLACES=124, PETRI_TRANSITIONS=114} [2023-11-29 00:55:38,585 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -11 predicate places. [2023-11-29 00:55:38,586 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 114 transitions, 380 flow [2023-11-29 00:55:38,586 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-29 00:55:38,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:55:38,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:55:38,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:55:38,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 00:55:38,787 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-29 00:55:38,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:55:38,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1620089800, now seen corresponding path program 1 times [2023-11-29 00:55:38,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:55:38,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434988155] [2023-11-29 00:55:38,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:55:38,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:55:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:55:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:55:38,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:55:38,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434988155] [2023-11-29 00:55:38,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434988155] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:55:38,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:55:38,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:55:38,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168513957] [2023-11-29 00:55:38,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:55:38,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:55:38,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:55:38,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:55:38,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:55:38,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 142 [2023-11-29 00:55:38,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 114 transitions, 380 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-29 00:55:38,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:55:38,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 142 [2023-11-29 00:55:38,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:55:39,242 INFO L124 PetriNetUnfolderBase]: 1019/2394 cut-off events. [2023-11-29 00:55:39,243 INFO L125 PetriNetUnfolderBase]: For 490/490 co-relation queries the response was YES. [2023-11-29 00:55:39,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5233 conditions, 2394 events. 1019/2394 cut-off events. For 490/490 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 14704 event pairs, 661 based on Foata normal form. 12/2165 useless extension candidates. Maximal degree in co-relation 4070. Up to 1089 conditions per place. [2023-11-29 00:55:39,255 INFO L140 encePairwiseOnDemand]: 138/142 looper letters, 75 selfloop transitions, 3 changer transitions 0/125 dead transitions. [2023-11-29 00:55:39,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 125 transitions, 562 flow [2023-11-29 00:55:39,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:55:39,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:55:39,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2023-11-29 00:55:39,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7370892018779343 [2023-11-29 00:55:39,257 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2023-11-29 00:55:39,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2023-11-29 00:55:39,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:55:39,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2023-11-29 00:55:39,258 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-29 00:55:39,259 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-29 00:55:39,259 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-29 00:55:39,259 INFO L175 Difference]: Start difference. First operand has 124 places, 114 transitions, 380 flow. Second operand 3 states and 314 transitions. [2023-11-29 00:55:39,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 125 transitions, 562 flow [2023-11-29 00:55:39,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 125 transitions, 532 flow, removed 9 selfloop flow, removed 6 redundant places. [2023-11-29 00:55:39,265 INFO L231 Difference]: Finished difference. Result has 120 places, 113 transitions, 354 flow [2023-11-29 00:55:39,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=118, 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=354, PETRI_PLACES=120, PETRI_TRANSITIONS=113} [2023-11-29 00:55:39,266 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -15 predicate places. [2023-11-29 00:55:39,266 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 113 transitions, 354 flow [2023-11-29 00:55:39,266 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-29 00:55:39,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:55:39,267 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-29 00:55:39,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 00:55:39,267 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-29 00:55:39,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:55:39,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1988889243, now seen corresponding path program 1 times [2023-11-29 00:55:39,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:55:39,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922957128] [2023-11-29 00:55:39,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:55:39,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:55:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:55:39,375 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-29 00:55:39,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:55:39,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922957128] [2023-11-29 00:55:39,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922957128] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:55:39,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:55:39,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:55:39,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096263610] [2023-11-29 00:55:39,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:55:39,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:55:39,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:55:39,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:55:39,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:55:39,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 142 [2023-11-29 00:55:39,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 113 transitions, 354 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-29 00:55:39,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:55:39,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 142 [2023-11-29 00:55:39,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:55:39,677 INFO L124 PetriNetUnfolderBase]: 710/1849 cut-off events. [2023-11-29 00:55:39,677 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2023-11-29 00:55:39,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4019 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 10909 event pairs, 126 based on Foata normal form. 72/1751 useless extension candidates. Maximal degree in co-relation 3100. Up to 1103 conditions per place. [2023-11-29 00:55:39,686 INFO L140 encePairwiseOnDemand]: 138/142 looper letters, 70 selfloop transitions, 4 changer transitions 0/121 dead transitions. [2023-11-29 00:55:39,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 121 transitions, 520 flow [2023-11-29 00:55:39,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:55:39,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:55:39,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2023-11-29 00:55:39,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7370892018779343 [2023-11-29 00:55:39,688 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2023-11-29 00:55:39,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2023-11-29 00:55:39,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:55:39,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2023-11-29 00:55:39,689 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-29 00:55:39,690 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-29 00:55:39,691 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-29 00:55:39,691 INFO L175 Difference]: Start difference. First operand has 120 places, 113 transitions, 354 flow. Second operand 3 states and 314 transitions. [2023-11-29 00:55:39,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 121 transitions, 520 flow [2023-11-29 00:55:39,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 121 transitions, 514 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:55:39,697 INFO L231 Difference]: Finished difference. Result has 120 places, 113 transitions, 356 flow [2023-11-29 00:55:39,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=118, 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=356, PETRI_PLACES=120, PETRI_TRANSITIONS=113} [2023-11-29 00:55:39,698 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -15 predicate places. [2023-11-29 00:55:39,698 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 113 transitions, 356 flow [2023-11-29 00:55:39,698 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-29 00:55:39,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:55:39,698 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-29 00:55:39,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 00:55:39,698 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-29 00:55:39,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:55:39,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1648931394, now seen corresponding path program 1 times [2023-11-29 00:55:39,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:55:39,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427085415] [2023-11-29 00:55:39,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:55:39,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:55:39,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:55:40,592 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-29 00:55:40,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:55:40,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427085415] [2023-11-29 00:55:40,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427085415] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:55:40,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926021342] [2023-11-29 00:55:40,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:55:40,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:55:40,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:55:40,595 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:55:40,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 00:55:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:55:40,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 55 conjunts are in the unsatisfiable core [2023-11-29 00:55:40,750 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:55:40,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:55:40,823 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-29 00:55:41,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:55:41,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:55:41,039 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-29 00:55:41,075 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-29 00:55:41,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:55:41,247 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-29 00:55:41,263 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-29 00:55:41,288 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-29 00:55:41,288 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:55:42,394 INFO L349 Elim1Store]: treesize reduction 68, result has 31.3 percent of original size [2023-11-29 00:55:42,395 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 184 treesize of output 163 [2023-11-29 00:55:42,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:55:42,407 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 128 treesize of output 124 [2023-11-29 00:55:42,418 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-29 00:55:42,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:55:42,444 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 134 treesize of output 128 [2023-11-29 00:55:42,545 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-29 00:55:42,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926021342] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:55:42,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:55:42,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 14] total 37 [2023-11-29 00:55:42,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539753252] [2023-11-29 00:55:42,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:55:42,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-29 00:55:42,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:55:42,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-29 00:55:42,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1165, Unknown=0, NotChecked=0, Total=1406 [2023-11-29 00:55:48,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 00:55:53,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 142 [2023-11-29 00:55:53,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 113 transitions, 356 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-29 00:55:53,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:55:53,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 142 [2023-11-29 00:55:53,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:55:55,419 INFO L124 PetriNetUnfolderBase]: 835/1990 cut-off events. [2023-11-29 00:55:55,419 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2023-11-29 00:55:55,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4512 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 11062 event pairs, 108 based on Foata normal form. 0/1832 useless extension candidates. Maximal degree in co-relation 3103. Up to 541 conditions per place. [2023-11-29 00:55:55,426 INFO L140 encePairwiseOnDemand]: 127/142 looper letters, 180 selfloop transitions, 30 changer transitions 0/247 dead transitions. [2023-11-29 00:55:55,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 247 transitions, 1117 flow [2023-11-29 00:55:55,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 00:55:55,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-11-29 00:55:55,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1871 transitions. [2023-11-29 00:55:55,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6274312541918176 [2023-11-29 00:55:55,431 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1871 transitions. [2023-11-29 00:55:55,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1871 transitions. [2023-11-29 00:55:55,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:55:55,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1871 transitions. [2023-11-29 00:55:55,437 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-29 00:55:55,442 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-29 00:55:55,443 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-29 00:55:55,443 INFO L175 Difference]: Start difference. First operand has 120 places, 113 transitions, 356 flow. Second operand 21 states and 1871 transitions. [2023-11-29 00:55:55,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 247 transitions, 1117 flow [2023-11-29 00:55:55,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 247 transitions, 1105 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:55:55,451 INFO L231 Difference]: Finished difference. Result has 142 places, 119 transitions, 460 flow [2023-11-29 00:55:55,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=119, 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=460, PETRI_PLACES=142, PETRI_TRANSITIONS=119} [2023-11-29 00:55:55,452 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 7 predicate places. [2023-11-29 00:55:55,452 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 119 transitions, 460 flow [2023-11-29 00:55:55,453 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-29 00:55:55,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:55:55,453 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-29 00:55:55,459 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 00:55:55,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-29 00:55:55,654 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-29 00:55:55,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:55:55,654 INFO L85 PathProgramCache]: Analyzing trace with hash -623315496, now seen corresponding path program 1 times [2023-11-29 00:55:55,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:55:55,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64070915] [2023-11-29 00:55:55,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:55:55,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:55:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:55:55,725 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-29 00:55:55,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:55:55,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64070915] [2023-11-29 00:55:55,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64070915] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:55:55,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612405027] [2023-11-29 00:55:55,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:55:55,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:55:55,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:55:55,726 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:55:55,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 00:55:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:55:55,892 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:55:55,895 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:55:55,920 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-29 00:55:55,920 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:55:55,954 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-29 00:55:55,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612405027] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:55:55,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:55:55,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-29 00:55:55,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289117509] [2023-11-29 00:55:55,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:55:55,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:55:55,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:55:55,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:55:55,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:55:55,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 142 [2023-11-29 00:55:55,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 119 transitions, 460 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-29 00:55:55,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:55:55,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 142 [2023-11-29 00:55:55,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:55:56,260 INFO L124 PetriNetUnfolderBase]: 566/1409 cut-off events. [2023-11-29 00:55:56,261 INFO L125 PetriNetUnfolderBase]: For 476/476 co-relation queries the response was YES. [2023-11-29 00:55:56,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3681 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 6086 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-29 00:55:56,266 INFO L140 encePairwiseOnDemand]: 138/142 looper letters, 92 selfloop transitions, 6 changer transitions 0/147 dead transitions. [2023-11-29 00:55:56,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 147 transitions, 724 flow [2023-11-29 00:55:56,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:55:56,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:55:56,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 610 transitions. [2023-11-29 00:55:56,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.715962441314554 [2023-11-29 00:55:56,268 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 610 transitions. [2023-11-29 00:55:56,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 610 transitions. [2023-11-29 00:55:56,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:55:56,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 610 transitions. [2023-11-29 00:55:56,270 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-29 00:55:56,271 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-29 00:55:56,271 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-29 00:55:56,272 INFO L175 Difference]: Start difference. First operand has 142 places, 119 transitions, 460 flow. Second operand 6 states and 610 transitions. [2023-11-29 00:55:56,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 147 transitions, 724 flow [2023-11-29 00:55:56,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 147 transitions, 662 flow, removed 8 selfloop flow, removed 17 redundant places. [2023-11-29 00:55:56,280 INFO L231 Difference]: Finished difference. Result has 134 places, 120 transitions, 428 flow [2023-11-29 00:55:56,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=125, 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=428, PETRI_PLACES=134, PETRI_TRANSITIONS=120} [2023-11-29 00:55:56,281 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -1 predicate places. [2023-11-29 00:55:56,281 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 120 transitions, 428 flow [2023-11-29 00:55:56,281 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-29 00:55:56,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:55:56,282 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-29 00:55:56,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-29 00:55:56,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-29 00:55:56,482 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-29 00:55:56,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:55:56,482 INFO L85 PathProgramCache]: Analyzing trace with hash 423810259, now seen corresponding path program 1 times [2023-11-29 00:55:56,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:55:56,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884598697] [2023-11-29 00:55:56,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:55:56,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:55:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:55:56,669 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-29 00:55:56,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:55:56,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884598697] [2023-11-29 00:55:56,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884598697] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:55:56,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327340357] [2023-11-29 00:55:56,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:55:56,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:55:56,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:55:56,670 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:55:56,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 00:55:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:55:56,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 00:55:56,841 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:55:56,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:55:56,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 00:55:56,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:55:56,870 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-29 00:55:56,871 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 16 treesize of output 1 [2023-11-29 00:55:57,094 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-29 00:55:57,094 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:55:57,261 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-29 00:55:57,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327340357] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:55:57,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:55:57,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2023-11-29 00:55:57,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932661916] [2023-11-29 00:55:57,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:55:57,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 00:55:57,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:55:57,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 00:55:57,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:55:58,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 142 [2023-11-29 00:55:58,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 120 transitions, 428 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-29 00:55:58,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:55:58,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 142 [2023-11-29 00:55:58,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:55:58,431 INFO L124 PetriNetUnfolderBase]: 676/1629 cut-off events. [2023-11-29 00:55:58,431 INFO L125 PetriNetUnfolderBase]: For 699/699 co-relation queries the response was YES. [2023-11-29 00:55:58,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4236 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 7430 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-29 00:55:58,438 INFO L140 encePairwiseOnDemand]: 137/142 looper letters, 102 selfloop transitions, 7 changer transitions 0/157 dead transitions. [2023-11-29 00:55:58,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 157 transitions, 771 flow [2023-11-29 00:55:58,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:55:58,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 00:55:58,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 782 transitions. [2023-11-29 00:55:58,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6883802816901409 [2023-11-29 00:55:58,439 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 782 transitions. [2023-11-29 00:55:58,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 782 transitions. [2023-11-29 00:55:58,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:55:58,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 782 transitions. [2023-11-29 00:55:58,440 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-29 00:55:58,442 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-29 00:55:58,442 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-29 00:55:58,442 INFO L175 Difference]: Start difference. First operand has 134 places, 120 transitions, 428 flow. Second operand 8 states and 782 transitions. [2023-11-29 00:55:58,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 157 transitions, 771 flow [2023-11-29 00:55:58,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 157 transitions, 761 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-29 00:55:58,452 INFO L231 Difference]: Finished difference. Result has 143 places, 121 transitions, 454 flow [2023-11-29 00:55:58,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=133, 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=454, PETRI_PLACES=143, PETRI_TRANSITIONS=121} [2023-11-29 00:55:58,452 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 8 predicate places. [2023-11-29 00:55:58,453 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 121 transitions, 454 flow [2023-11-29 00:55:58,453 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-29 00:55:58,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:55:58,453 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-29 00:55:58,458 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 00:55:58,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:55:58,654 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-29 00:55:58,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:55:58,654 INFO L85 PathProgramCache]: Analyzing trace with hash 738668258, now seen corresponding path program 2 times [2023-11-29 00:55:58,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:55:58,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761032707] [2023-11-29 00:55:58,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:55:58,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:55:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:56:00,929 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-29 00:56:00,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:56:00,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761032707] [2023-11-29 00:56:00,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761032707] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:56:00,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680164818] [2023-11-29 00:56:00,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:56:00,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:56:00,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:56:00,930 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:56:00,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_323a1e17-95cb-4e2b-997f-54a01b261a26/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 00:56:01,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:56:01,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:56:01,084 INFO L262 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 103 conjunts are in the unsatisfiable core [2023-11-29 00:56:01,089 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:56:01,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:56:01,173 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-29 00:56:01,226 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-29 00:56:01,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:56:01,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:56:01,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:56:01,568 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-29 00:56:01,605 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-29 00:56:01,745 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 26 treesize of output 21 [2023-11-29 00:56:01,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:56:01,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:56:01,916 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-29 00:56:01,949 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-29 00:56:02,055 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 26 treesize of output 21 [2023-11-29 00:56:02,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:56:02,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:56:02,247 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-29 00:56:02,285 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-29 00:56:02,401 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 26 treesize of output 21 [2023-11-29 00:56:02,564 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-29 00:56:02,564 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:56:20,750 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (store |c_#memory_int#5| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (select |c_#memory_int#5| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)))) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse1 .cse2))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ (* (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) |t1Thread1of1ForFork0_enqueue_~x#1|) .cse2) 4) |c_~#queue~0.offset| 8) (select |c_#length| |c_~#queue~0.base|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ (* (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) |t1Thread1of1ForFork0_enqueue_~x#1|) .cse2) 4) |c_~#queue~0.offset| 4)))))))) is different from false [2023-11-29 00:56:40,318 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int#5| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse6 .cse5)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_701 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse1 (select (store |c_#memory_int#5| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse3 .cse4 v_ArrVal_701) .cse5 (+ (select .cse3 .cse5) 1)))) |c_~#queue~0.base|))) (or (forall ((v_subst_1 Int)) (<= 0 (+ (* (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_subst_1) .cse2) 4) |c_~#queue~0.offset| 4))) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_701 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse7 (select (store |c_#memory_int#5| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse8 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse8 .cse4 v_ArrVal_701) .cse5 (+ (select .cse8 .cse5) 1)))) |c_~#queue~0.base|))) (or (forall ((v_subst_2 Int)) (<= (+ (* (select (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_subst_2) .cse2) 4) |c_~#queue~0.offset| 8) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse7 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|))))))))) is different from false [2023-11-29 00:58:21,029 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select (store |c_#memory_int#5| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int#5| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse3)) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_701 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse1 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse4 (+ (select .cse1 .cse3) 1))) (or (forall ((v_subst_1 Int)) (<= 0 (+ (* (select (store (store (store .cse1 .cse2 v_ArrVal_701) .cse3 .cse4) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_subst_1) .cse3) 4) |c_~#queue~0.offset| 4))) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_701 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse6 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse7 (+ (select .cse6 .cse3) 1))) (or (forall ((v_subst_2 Int)) (<= (+ (* (select (store (store (store .cse6 .cse2 v_ArrVal_701) .cse3 .cse7) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_subst_2) .cse3) 4) |c_~#queue~0.offset| 8) (select |c_#length| |c_~#queue~0.base|))) (< .cse7 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)))))))))) is different from false [2023-11-29 00:58:25,079 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (store |c_#memory_int#5| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse8 (select |c_#memory_int#5| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse8 .cse9 (+ (select .cse8 .cse9) 1)))) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (select .cse4 .cse2)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_701 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse3 (+ (select .cse0 .cse2) 1))) (or (forall ((v_subst_2 Int)) (<= (+ (* (select (store (store (store .cse0 .cse1 v_ArrVal_701) .cse2 .cse3) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_subst_2) .cse2) 4) |c_~#queue~0.offset| 8) (select |c_#length| |c_~#queue~0.base|))) (< .cse3 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|))))) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (or (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_701 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse6 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse7 (+ (select .cse6 .cse2) 1))) (or (forall ((v_subst_1 Int)) (<= 0 (+ (* 4 (select (store (store (store .cse6 .cse1 v_ArrVal_701) .cse2 .cse7) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_subst_1) .cse2)) |c_~#queue~0.offset| 4))) (< .cse7 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)))))))))) is different from false [2023-11-29 00:58:29,201 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int#5| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse8 (+ (select .cse5 .cse7) 1))) (and (forall ((v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse0 (select (store |c_#memory_int#5| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_696) .cse7 .cse8)) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_701 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse4 (+ (select .cse2 .cse1) 1))) (or (forall ((v_subst_1 Int)) (<= 0 (+ (* (select (store (store (store .cse2 .cse3 v_ArrVal_701) .cse1 .cse4) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_subst_1) .cse1) 4) |c_~#queue~0.offset| 4))) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)))))))) (forall ((v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse11 (select (store |c_#memory_int#5| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_696) .cse7 .cse8)) |c_~#queue~0.base|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_701 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse9 (store .cse11 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse10 (+ (select .cse9 .cse1) 1))) (or (forall ((v_subst_2 Int)) (<= (+ |c_~#queue~0.offset| 8 (* (select (store (store (store .cse9 .cse3 v_ArrVal_701) .cse1 .cse10) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_subst_2) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))) (< .cse10 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|))))) (< (select .cse11 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|))))))) is different from false [2023-11-29 00:58:33,308 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse8 (select |c_#memory_int#5| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (select (store |c_#memory_int#5| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store .cse8 .cse9 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse5 .cse6 v_ArrVal_696) .cse7 (+ (select .cse5 .cse7) 1)))) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_subst_4 Int) (v_ArrVal_701 Int)) (let ((.cse2 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_subst_4))) (let ((.cse4 (+ (select .cse2 .cse1) 1))) (or (forall ((v_subst_2 Int)) (<= (+ (* (select (store (store (store .cse2 .cse3 v_ArrVal_701) .cse1 .cse4) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_subst_2) .cse1) 4) |c_~#queue~0.offset| 8) (select |c_#length| |c_~#queue~0.base|))) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)))))))) (forall ((v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse10 (select (store |c_#memory_int#5| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (store .cse8 .cse9 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse13 .cse6 v_ArrVal_696) .cse7 (+ (select .cse13 .cse7) 1)))) |c_~#queue~0.base|))) (or (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_subst_3 Int) (v_ArrVal_701 Int)) (let ((.cse11 (store .cse10 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_subst_3))) (let ((.cse12 (+ (select .cse11 .cse1) 1))) (or (forall ((v_subst_1 Int)) (<= 0 (+ |c_~#queue~0.offset| 4 (* (select (store (store (store .cse11 .cse3 v_ArrVal_701) .cse1 .cse12) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_subst_1) .cse1) 4)))) (< .cse12 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)))))))))) is different from false [2023-11-29 00:58:37,375 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int#5| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse9 .cse8)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) (forall ((v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse5 (select (store |c_#memory_int#5| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse6 .cse7 v_ArrVal_696) .cse8 (+ (select .cse6 .cse8) 1)))) |c_~#queue~0.base|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_subst_4 Int) (v_ArrVal_701 Int)) (let ((.cse2 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_subst_4))) (let ((.cse1 (+ (select .cse2 .cse4) 1))) (or (< .cse1 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) (forall ((v_subst_2 Int)) (<= (+ (* (select (store (store (store .cse2 .cse3 v_ArrVal_701) .cse4 .cse1) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_subst_2) .cse4) 4) |c_~#queue~0.offset| 8) (select |c_#length| |c_~#queue~0.base|))))))) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) (forall ((v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse12 (select (store |c_#memory_int#5| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse13 .cse7 v_ArrVal_696) .cse8 (+ (select .cse13 .cse8) 1)))) |c_~#queue~0.base|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_subst_3 Int) (v_ArrVal_701 Int)) (let ((.cse11 (store .cse12 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_subst_3))) (let ((.cse10 (+ 1 (select .cse11 .cse4)))) (or (< .cse10 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) (forall ((v_subst_1 Int)) (<= 0 (+ (* (select (store (store (store .cse11 .cse3 v_ArrVal_701) .cse4 .cse10) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_subst_1) .cse4) 4) |c_~#queue~0.offset| 4))))))) (< (select .cse12 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|))))))))) is different from false [2023-11-29 01:00:18,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:00:18,460 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 491 treesize of output 495 [2023-11-29 01:00:20,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:00:20,115 INFO L349 Elim1Store]: treesize reduction 79, result has 34.2 percent of original size [2023-11-29 01:00:20,115 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 401 treesize of output 315 [2023-11-29 01:00:20,128 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 240 treesize of output 220 [2023-11-29 01:00:20,163 INFO L349 Elim1Store]: treesize reduction 15, result has 48.3 percent of original size [2023-11-29 01:00:20,163 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 201 treesize of output 186 [2023-11-29 01:00:20,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:00:20,391 INFO L349 Elim1Store]: treesize reduction 89, result has 25.8 percent of original size [2023-11-29 01:00:20,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 400 treesize of output 304 [2023-11-29 01:00:20,405 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 191 treesize of output 173 [2023-11-29 01:00:20,411 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:00:20,432 INFO L349 Elim1Store]: treesize reduction 25, result has 13.8 percent of original size [2023-11-29 01:00:20,433 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 122 treesize of output 102 [2023-11-29 01:00:20,566 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 18 refuted. 1 times theorem prover too weak. 0 trivial. 23 not checked. [2023-11-29 01:00:20,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680164818] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:00:20,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:00:20,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 24] total 63 [2023-11-29 01:00:20,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924118807] [2023-11-29 01:00:20,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:00:20,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2023-11-29 01:00:20,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:00:20,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2023-11-29 01:00:20,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=2877, Unknown=44, NotChecked=826, Total=4160 [2023-11-29 01:00:20,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 142 [2023-11-29 01:00:20,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 121 transitions, 454 flow. Second operand has 65 states, 65 states have (on average 30.26153846153846) internal successors, (1967), 65 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:00:20,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:00:20,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 142 [2023-11-29 01:00:20,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:00:31,413 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-29 01:00:35,447 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-29 01:00:53,141 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-29 01:01:36,280 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-29 01:01:40,387 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-29 01:01:44,391 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-29 01:01:45,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:01:54,127 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-29 01:01:58,133 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-29 01:02:02,297 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-29 01:02:06,299 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-29 01:02:10,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.85s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:02:14,166 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-29 01:02:15,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:02:20,076 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-29 01:02:24,090 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-29 01:02:28,092 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-29 01:03:02,397 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-29 01:03:06,399 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-29 01:03:10,413 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-29 01:03:14,415 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-29 01:03:18,428 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-29 01:03:20,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:03:24,046 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-29 01:03:29,091 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-29 01:03:33,107 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-29 01:03:37,114 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-29 01:03:41,128 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int#5| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse5 (select |c_#memory_int#5| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse8 (select .cse5 .cse4)) (.cse18 (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) (.cse9 (select .cse14 .cse1))) (let ((.cse15 (* 4 .cse9)) (.cse11 (+ 1608 |c_~#queue~0.offset|)) (.cse19 (select |c_#length| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ .cse18 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse13 (select |c_#length| |c_~#queue~0.base|)) (.cse22 (* .cse8 4))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_701 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (select (store |c_#memory_int#5| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store .cse5 .cse6 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse2 .cse3 v_ArrVal_701) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) (forall ((v_subst_1 Int)) (<= 0 (+ (* 4 (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_subst_1) .cse1)) |c_~#queue~0.offset| 4)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int)) (or (forall ((v_ArrVal_705 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int#5| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse7 .cse3 v_ArrVal_705) .cse4 (+ (select .cse7 .cse4) 1)))) |c_~#queue~0.base|) .cse1) 4)))) (< .cse8 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (or (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_701 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse10 (store .cse14 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse12 (+ (select .cse10 .cse1) 1))) (or (forall ((v_subst_2 Int)) (<= (+ (* (select (store (store (store .cse10 .cse11 v_ArrVal_701) .cse1 .cse12) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_subst_2) .cse1) 4) |c_~#queue~0.offset| 8) .cse13)) (< .cse12 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|))))))) (<= 0 (+ .cse15 |c_~#queue~0.offset|)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int)) (or (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ (* (select (store .cse14 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1) 4) |c_~#queue~0.offset| 8) .cse13)))) (forall ((v_ArrVal_705 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int#5| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse16 (store .cse5 .cse6 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse16 .cse3 v_ArrVal_705) .cse4 (+ (select .cse16 .cse4) 1)))) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_705 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int#5| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse17 (store .cse5 .cse6 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse17 .cse3 v_ArrVal_705) .cse4 (+ (select .cse17 .cse4) 1)))) |c_~#queue~0.base|) .cse1) 4)) .cse13)) (<= (+ .cse15 |c_~#queue~0.offset| 4) .cse13) (<= (+ .cse18 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) .cse19) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (or (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_701 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse20 (store .cse14 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse21 (+ (select .cse20 .cse1) 1))) (or (forall ((v_subst_1 Int)) (<= 0 (+ |c_~#queue~0.offset| 4 (* (select (store (store (store .cse20 .cse11 v_ArrVal_701) .cse1 .cse21) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_subst_1) .cse1) 4)))) (< .cse21 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|))))))) (<= (+ .cse22 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) .cse19) (<= 0 .cse6) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_701 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse23 (select (store |c_#memory_int#5| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse24 (store .cse5 .cse6 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse24 .cse3 v_ArrVal_701) .cse4 (+ (select .cse24 .cse4) 1)))) |c_~#queue~0.base|))) (or (< (select .cse23 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) (forall ((v_subst_2 Int)) (<= (+ (* (select (store .cse23 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_subst_2) .cse1) 4) |c_~#queue~0.offset| 8) .cse13))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int)) (or (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ (* (select (store .cse14 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1) 4) |c_~#queue~0.offset| 4))) (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int)) (or (< .cse8 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) (forall ((v_ArrVal_705 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int#5| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse25 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse25 .cse3 v_ArrVal_705) .cse4 (+ (select .cse25 .cse4) 1)))) |c_~#queue~0.base|) .cse1) 4) 4) .cse13)))) (<= 0 (+ .cse22 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) is different from false [2023-11-29 01:03:45,750 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-29 01:03:49,767 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-29 01:03:53,769 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-29 01:03:57,783 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-29 01:04:01,789 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-29 01:04:05,812 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-29 01:04:09,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:04:13,834 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-29 01:04:22,590 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-29 01:04:45,412 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-29 01:04:49,414 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-29 01:04:53,422 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-29 01:05:33,493 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-29 01:05:35,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:05:40,085 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-29 01:05:44,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-29 01:06:12,229 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-29 01:06:14,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:06:18,755 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-29 01:06:22,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-29 01:06:26,763 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-29 01:06:30,777 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-29 01:06:34,787 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-29 01:06:38,795 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-29 01:06:42,807 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-29 01:06:46,818 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-29 01:06:50,826 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-29 01:06:54,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:06:58,858 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-29 01:07:02,872 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-29 01:07:06,876 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-29 01:07:10,891 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-29 01:07:14,947 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-29 01:07:18,949 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-29 01:07:22,961 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-29 01:07:27,007 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-29 01:07:31,016 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-29 01:07:36,239 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-29 01:07:40,245 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-29 01:08:32,007 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-29 01:08: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-29 01:08:40,180 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-29 01:08:44,260 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-29 01:08:48,265 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-29 01:08:52,273 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-29 01:08:56,287 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-29 01:09:00,289 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-29 01:09:04,300 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-29 01:09:08,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:09:10,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:09:14,467 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]