./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c7d3b8-bb12-4d71-895b-3e4344479b71/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c7d3b8-bb12-4d71-895b-3e4344479b71/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c7d3b8-bb12-4d71-895b-3e4344479b71/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c7d3b8-bb12-4d71-895b-3e4344479b71/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist-deref.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c7d3b8-bb12-4d71-895b-3e4344479b71/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c7d3b8-bb12-4d71-895b-3e4344479b71/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 531fb1e21d8f5a9631a3764359a014fcdd0042558e9afceaf1b553fa03cda562 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:52:02,363 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:52:02,477 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c7d3b8-bb12-4d71-895b-3e4344479b71/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-26 11:52:02,485 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:52:02,486 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:52:02,525 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:52:02,526 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:52:02,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:52:02,528 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:52:02,533 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:52:02,533 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:52:02,535 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:52:02,535 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:52:02,537 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:52:02,538 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:52:02,538 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:52:02,539 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:52:02,539 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:52:02,540 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:52:02,540 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:52:02,540 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 11:52:02,541 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 11:52:02,541 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 11:52:02,542 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:52:02,542 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 11:52:02,543 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 11:52:02,543 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:52:02,544 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:52:02,545 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:52:02,545 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:52:02,546 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:52:02,547 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:52:02,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:52:02,547 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:52:02,547 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:52:02,548 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:52:02,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:52:02,548 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:52:02,548 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:52:02,549 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:52:02,549 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:52:02,549 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_c3c7d3b8-bb12-4d71-895b-3e4344479b71/bin/uautomizer-verify-VRDe98Ueme/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c7d3b8-bb12-4d71-895b-3e4344479b71/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 531fb1e21d8f5a9631a3764359a014fcdd0042558e9afceaf1b553fa03cda562 [2023-11-26 11:52:02,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:52:02,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:52:02,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:52:02,949 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:52:02,949 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:52:02,951 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c7d3b8-bb12-4d71-895b-3e4344479b71/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist-deref.i [2023-11-26 11:52:05,997 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:52:06,305 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:52:06,306 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c7d3b8-bb12-4d71-895b-3e4344479b71/sv-benchmarks/c/goblint-regression/09-regions_09-arraylist-deref.i [2023-11-26 11:52:06,327 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c7d3b8-bb12-4d71-895b-3e4344479b71/bin/uautomizer-verify-VRDe98Ueme/data/6bd2d9e3a/d8d1623f64934c73aeda374917af2fbe/FLAGc68c281aa [2023-11-26 11:52:06,370 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c7d3b8-bb12-4d71-895b-3e4344479b71/bin/uautomizer-verify-VRDe98Ueme/data/6bd2d9e3a/d8d1623f64934c73aeda374917af2fbe [2023-11-26 11:52:06,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:52:06,378 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:52:06,382 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:52:06,382 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:52:06,400 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:52:06,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:52:06" (1/1) ... [2023-11-26 11:52:06,408 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69c69c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:06, skipping insertion in model container [2023-11-26 11:52:06,408 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:52:06" (1/1) ... [2023-11-26 11:52:06,489 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:52:07,178 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:52:07,193 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:52:07,262 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:52:07,365 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:52:07,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:07 WrapperNode [2023-11-26 11:52:07,366 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:52:07,367 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:52:07,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:52:07,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:52:07,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:07" (1/1) ... [2023-11-26 11:52:07,412 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:07" (1/1) ... [2023-11-26 11:52:07,444 INFO L138 Inliner]: procedures = 372, calls = 37, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 118 [2023-11-26 11:52:07,444 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:52:07,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:52:07,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:52:07,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:52:07,461 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:07" (1/1) ... [2023-11-26 11:52:07,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:07" (1/1) ... [2023-11-26 11:52:07,467 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:07" (1/1) ... [2023-11-26 11:52:07,492 INFO L175 MemorySlicer]: Split 25 memory accesses to 4 slices as follows [5, 5, 1, 14]. 56 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [5, 0, 0, 0]. The 13 writes are split as follows [0, 2, 1, 10]. [2023-11-26 11:52:07,493 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:07" (1/1) ... [2023-11-26 11:52:07,493 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:07" (1/1) ... [2023-11-26 11:52:07,510 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:07" (1/1) ... [2023-11-26 11:52:07,512 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:07" (1/1) ... [2023-11-26 11:52:07,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:07" (1/1) ... [2023-11-26 11:52:07,518 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:07" (1/1) ... [2023-11-26 11:52:07,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:52:07,535 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:52:07,542 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:52:07,542 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:52:07,543 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:07" (1/1) ... [2023-11-26 11:52:07,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:52:07,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c7d3b8-bb12-4d71-895b-3e4344479b71/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:52:07,578 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c7d3b8-bb12-4d71-895b-3e4344479b71/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:52:07,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c7d3b8-bb12-4d71-895b-3e4344479b71/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:52:07,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 11:52:07,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-26 11:52:07,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-26 11:52:07,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-26 11:52:07,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-26 11:52:07,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:52:07,629 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-26 11:52:07,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-26 11:52:07,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-26 11:52:07,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-26 11:52:07,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-26 11:52:07,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 11:52:07,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 11:52:07,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 11:52:07,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-26 11:52:07,632 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-26 11:52:07,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-26 11:52:07,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:52:07,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-26 11:52:07,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-26 11:52:07,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-26 11:52:07,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-26 11:52:07,634 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-11-26 11:52:07,635 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-11-26 11:52:07,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:52:07,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 11:52:07,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 11:52:07,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-26 11:52:07,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:52:07,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:52:07,639 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 11:52:07,882 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:52:07,884 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:52:08,350 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:52:08,551 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:52:08,551 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 11:52:08,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:52:08 BoogieIcfgContainer [2023-11-26 11:52:08,552 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:52:08,555 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:52:08,556 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:52:08,559 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:52:08,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:52:06" (1/3) ... [2023-11-26 11:52:08,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264ff5e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:52:08, skipping insertion in model container [2023-11-26 11:52:08,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:07" (2/3) ... [2023-11-26 11:52:08,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264ff5e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:52:08, skipping insertion in model container [2023-11-26 11:52:08,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:52:08" (3/3) ... [2023-11-26 11:52:08,565 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_09-arraylist-deref.i [2023-11-26 11:52:08,589 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:52:08,589 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2023-11-26 11:52:08,589 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 11:52:08,651 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 11:52:08,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 72 transitions, 148 flow [2023-11-26 11:52:08,730 INFO L124 PetriNetUnfolderBase]: 0/71 cut-off events. [2023-11-26 11:52:08,730 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:52:08,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 71 events. 0/71 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 169 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2023-11-26 11:52:08,732 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 72 transitions, 148 flow [2023-11-26 11:52:08,737 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 71 transitions, 145 flow [2023-11-26 11:52:08,748 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:52:08,755 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;@5e1767ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:52:08,756 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2023-11-26 11:52:08,759 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:52:08,759 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-26 11:52:08,759 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:52:08,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:52:08,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 11:52:08,761 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-26 11:52:08,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:52:08,767 INFO L85 PathProgramCache]: Analyzing trace with hash 12265, now seen corresponding path program 1 times [2023-11-26 11:52:08,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:52:08,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55555725] [2023-11-26 11:52:08,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:52:08,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:52:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:09,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:52:09,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:52:09,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55555725] [2023-11-26 11:52:09,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55555725] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:52:09,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:52:09,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:52:09,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300743106] [2023-11-26 11:52:09,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:52:09,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:52:09,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:52:09,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:52:09,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:52:09,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 72 [2023-11-26 11:52:09,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 71 transitions, 145 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:09,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:52:09,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 72 [2023-11-26 11:52:09,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:52:09,498 INFO L124 PetriNetUnfolderBase]: 63/263 cut-off events. [2023-11-26 11:52:09,498 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-26 11:52:09,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 263 events. 63/263 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1224 event pairs, 63 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 377. Up to 149 conditions per place. [2023-11-26 11:52:09,504 INFO L140 encePairwiseOnDemand]: 64/72 looper letters, 22 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2023-11-26 11:52:09,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 67 transitions, 189 flow [2023-11-26 11:52:09,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:52:09,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:52:09,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2023-11-26 11:52:09,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-26 11:52:09,521 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 156 transitions. [2023-11-26 11:52:09,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 156 transitions. [2023-11-26 11:52:09,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:52:09,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 156 transitions. [2023-11-26 11:52:09,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:09,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:09,534 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:09,536 INFO L175 Difference]: Start difference. First operand has 75 places, 71 transitions, 145 flow. Second operand 3 states and 156 transitions. [2023-11-26 11:52:09,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 67 transitions, 189 flow [2023-11-26 11:52:09,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 67 transitions, 188 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 11:52:09,544 INFO L231 Difference]: Finished difference. Result has 72 places, 67 transitions, 144 flow [2023-11-26 11:52:09,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=72, PETRI_TRANSITIONS=67} [2023-11-26 11:52:09,550 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -3 predicate places. [2023-11-26 11:52:09,550 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 67 transitions, 144 flow [2023-11-26 11:52:09,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:09,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:52:09,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 11:52:09,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:52:09,552 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-26 11:52:09,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:52:09,552 INFO L85 PathProgramCache]: Analyzing trace with hash 12266, now seen corresponding path program 1 times [2023-11-26 11:52:09,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:52:09,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076073546] [2023-11-26 11:52:09,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:52:09,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:52:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:09,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:52:09,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:52:09,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076073546] [2023-11-26 11:52:09,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076073546] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:52:09,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:52:09,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:52:09,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360735486] [2023-11-26 11:52:09,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:52:09,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:52:09,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:52:09,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:52:09,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:52:09,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 72 [2023-11-26 11:52:09,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 67 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:09,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:52:09,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 72 [2023-11-26 11:52:09,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:52:10,076 INFO L124 PetriNetUnfolderBase]: 63/259 cut-off events. [2023-11-26 11:52:10,076 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-26 11:52:10,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 259 events. 63/259 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1213 event pairs, 63 based on Foata normal form. 4/206 useless extension candidates. Maximal degree in co-relation 399. Up to 149 conditions per place. [2023-11-26 11:52:10,083 INFO L140 encePairwiseOnDemand]: 64/72 looper letters, 20 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2023-11-26 11:52:10,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 63 transitions, 184 flow [2023-11-26 11:52:10,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:52:10,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:52:10,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2023-11-26 11:52:10,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7407407407407407 [2023-11-26 11:52:10,096 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 160 transitions. [2023-11-26 11:52:10,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 160 transitions. [2023-11-26 11:52:10,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:52:10,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 160 transitions. [2023-11-26 11:52:10,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:10,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:10,106 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:10,106 INFO L175 Difference]: Start difference. First operand has 72 places, 67 transitions, 144 flow. Second operand 3 states and 160 transitions. [2023-11-26 11:52:10,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 63 transitions, 184 flow [2023-11-26 11:52:10,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 63 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:52:10,115 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 136 flow [2023-11-26 11:52:10,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2023-11-26 11:52:10,117 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -7 predicate places. [2023-11-26 11:52:10,117 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 136 flow [2023-11-26 11:52:10,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:10,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:52:10,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-26 11:52:10,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:52:10,120 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-26 11:52:10,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:52:10,132 INFO L85 PathProgramCache]: Analyzing trace with hash 11797165, now seen corresponding path program 1 times [2023-11-26 11:52:10,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:52:10,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833224706] [2023-11-26 11:52:10,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:52:10,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:52:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:10,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:52:10,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:52:10,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833224706] [2023-11-26 11:52:10,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833224706] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:52:10,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:52:10,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:52:10,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529034616] [2023-11-26 11:52:10,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:52:10,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:52:10,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:52:10,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:52:10,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:52:10,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 72 [2023-11-26 11:52:10,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:10,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:52:10,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 72 [2023-11-26 11:52:10,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:52:10,629 INFO L124 PetriNetUnfolderBase]: 73/282 cut-off events. [2023-11-26 11:52:10,630 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:52:10,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 282 events. 73/282 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1328 event pairs, 55 based on Foata normal form. 1/230 useless extension candidates. Maximal degree in co-relation 445. Up to 133 conditions per place. [2023-11-26 11:52:10,632 INFO L140 encePairwiseOnDemand]: 66/72 looper letters, 35 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-11-26 11:52:10,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 69 transitions, 222 flow [2023-11-26 11:52:10,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:52:10,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:52:10,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2023-11-26 11:52:10,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7592592592592593 [2023-11-26 11:52:10,635 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 164 transitions. [2023-11-26 11:52:10,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 164 transitions. [2023-11-26 11:52:10,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:52:10,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 164 transitions. [2023-11-26 11:52:10,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:10,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:10,638 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:10,638 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 136 flow. Second operand 3 states and 164 transitions. [2023-11-26 11:52:10,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 69 transitions, 222 flow [2023-11-26 11:52:10,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 69 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:52:10,641 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 130 flow [2023-11-26 11:52:10,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2023-11-26 11:52:10,643 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -9 predicate places. [2023-11-26 11:52:10,643 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 130 flow [2023-11-26 11:52:10,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:10,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:52:10,644 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-26 11:52:10,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:52:10,644 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-26 11:52:10,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:52:10,645 INFO L85 PathProgramCache]: Analyzing trace with hash 11797166, now seen corresponding path program 1 times [2023-11-26 11:52:10,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:52:10,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329727799] [2023-11-26 11:52:10,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:52:10,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:52:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:10,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:52:10,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:52:10,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329727799] [2023-11-26 11:52:10,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329727799] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:52:10,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:52:10,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:52:10,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282938779] [2023-11-26 11:52:10,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:52:10,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:52:10,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:52:10,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:52:10,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:52:11,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 72 [2023-11-26 11:52:11,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:11,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:52:11,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 72 [2023-11-26 11:52:11,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:52:11,215 INFO L124 PetriNetUnfolderBase]: 69/295 cut-off events. [2023-11-26 11:52:11,215 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-26 11:52:11,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 295 events. 69/295 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1539 event pairs, 24 based on Foata normal form. 3/233 useless extension candidates. Maximal degree in co-relation 451. Up to 124 conditions per place. [2023-11-26 11:52:11,218 INFO L140 encePairwiseOnDemand]: 65/72 looper letters, 31 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2023-11-26 11:52:11,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 68 transitions, 219 flow [2023-11-26 11:52:11,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:52:11,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 11:52:11,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 218 transitions. [2023-11-26 11:52:11,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7569444444444444 [2023-11-26 11:52:11,221 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 218 transitions. [2023-11-26 11:52:11,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 218 transitions. [2023-11-26 11:52:11,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:52:11,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 218 transitions. [2023-11-26 11:52:11,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:11,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:11,226 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:11,226 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 130 flow. Second operand 4 states and 218 transitions. [2023-11-26 11:52:11,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 68 transitions, 219 flow [2023-11-26 11:52:11,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 68 transitions, 213 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:52:11,230 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 143 flow [2023-11-26 11:52:11,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2023-11-26 11:52:11,232 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -9 predicate places. [2023-11-26 11:52:11,233 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 143 flow [2023-11-26 11:52:11,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:11,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:52:11,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:52:11,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:52:11,234 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-26 11:52:11,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:52:11,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1389887369, now seen corresponding path program 1 times [2023-11-26 11:52:11,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:52:11,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565501899] [2023-11-26 11:52:11,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:52:11,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:52:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:11,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:52:11,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:52:11,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565501899] [2023-11-26 11:52:11,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565501899] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:52:11,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:52:11,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:52:11,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687843777] [2023-11-26 11:52:11,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:52:11,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 11:52:11,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:52:11,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 11:52:11,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:52:12,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 72 [2023-11-26 11:52:12,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 143 flow. Second operand has 7 states, 7 states have (on average 37.142857142857146) internal successors, (260), 7 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:12,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:52:12,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 72 [2023-11-26 11:52:12,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:52:12,351 INFO L124 PetriNetUnfolderBase]: 63/245 cut-off events. [2023-11-26 11:52:12,351 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-26 11:52:12,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 245 events. 63/245 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1114 event pairs, 54 based on Foata normal form. 1/203 useless extension candidates. Maximal degree in co-relation 409. Up to 126 conditions per place. [2023-11-26 11:52:12,354 INFO L140 encePairwiseOnDemand]: 63/72 looper letters, 25 selfloop transitions, 8 changer transitions 3/66 dead transitions. [2023-11-26 11:52:12,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 66 transitions, 227 flow [2023-11-26 11:52:12,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:52:12,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 11:52:12,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 289 transitions. [2023-11-26 11:52:12,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5734126984126984 [2023-11-26 11:52:12,356 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 289 transitions. [2023-11-26 11:52:12,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 289 transitions. [2023-11-26 11:52:12,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:52:12,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 289 transitions. [2023-11-26 11:52:12,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 41.285714285714285) internal successors, (289), 7 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:12,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 72.0) internal successors, (576), 8 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:12,361 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 72.0) internal successors, (576), 8 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:12,361 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 143 flow. Second operand 7 states and 289 transitions. [2023-11-26 11:52:12,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 66 transitions, 227 flow [2023-11-26 11:52:12,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 66 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:52:12,364 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 150 flow [2023-11-26 11:52:12,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=150, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2023-11-26 11:52:12,365 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -7 predicate places. [2023-11-26 11:52:12,365 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 150 flow [2023-11-26 11:52:12,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.142857142857146) internal successors, (260), 7 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:12,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:52:12,366 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:52:12,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:52:12,367 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-26 11:52:12,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:52:12,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1389887370, now seen corresponding path program 1 times [2023-11-26 11:52:12,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:52:12,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570594363] [2023-11-26 11:52:12,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:52:12,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:52:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:12,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:52:12,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:52:12,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570594363] [2023-11-26 11:52:12,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570594363] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:52:12,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:52:12,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:52:12,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579200113] [2023-11-26 11:52:12,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:52:12,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 11:52:12,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:52:12,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 11:52:12,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:52:13,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 72 [2023-11-26 11:52:13,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 150 flow. Second operand has 7 states, 7 states have (on average 40.142857142857146) internal successors, (281), 7 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:13,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:52:13,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 72 [2023-11-26 11:52:13,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:52:13,202 INFO L124 PetriNetUnfolderBase]: 63/245 cut-off events. [2023-11-26 11:52:13,202 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-26 11:52:13,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 245 events. 63/245 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1120 event pairs, 45 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 411. Up to 107 conditions per place. [2023-11-26 11:52:13,205 INFO L140 encePairwiseOnDemand]: 63/72 looper letters, 31 selfloop transitions, 7 changer transitions 0/65 dead transitions. [2023-11-26 11:52:13,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 65 transitions, 242 flow [2023-11-26 11:52:13,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:52:13,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 11:52:13,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 311 transitions. [2023-11-26 11:52:13,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6170634920634921 [2023-11-26 11:52:13,208 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 311 transitions. [2023-11-26 11:52:13,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 311 transitions. [2023-11-26 11:52:13,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:52:13,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 311 transitions. [2023-11-26 11:52:13,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 44.42857142857143) internal successors, (311), 7 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:13,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 72.0) internal successors, (576), 8 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:13,214 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 72.0) internal successors, (576), 8 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:13,214 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 150 flow. Second operand 7 states and 311 transitions. [2023-11-26 11:52:13,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 65 transitions, 242 flow [2023-11-26 11:52:13,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 65 transitions, 226 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-26 11:52:13,218 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 144 flow [2023-11-26 11:52:13,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=144, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2023-11-26 11:52:13,220 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -9 predicate places. [2023-11-26 11:52:13,220 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 144 flow [2023-11-26 11:52:13,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 40.142857142857146) internal successors, (281), 7 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:13,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:52:13,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:52:13,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 11:52:13,221 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-26 11:52:13,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:52:13,222 INFO L85 PathProgramCache]: Analyzing trace with hash 53080476, now seen corresponding path program 1 times [2023-11-26 11:52:13,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:52:13,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992281393] [2023-11-26 11:52:13,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:52:13,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:52:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:13,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:52:13,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:52:13,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992281393] [2023-11-26 11:52:13,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992281393] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:52:13,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:52:13,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:52:13,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068864899] [2023-11-26 11:52:13,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:52:13,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:52:13,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:52:13,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:52:13,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:52:13,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 72 [2023-11-26 11:52:13,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:13,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:52:13,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 72 [2023-11-26 11:52:13,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:52:13,852 INFO L124 PetriNetUnfolderBase]: 63/242 cut-off events. [2023-11-26 11:52:13,852 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-26 11:52:13,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 242 events. 63/242 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1124 event pairs, 62 based on Foata normal form. 1/202 useless extension candidates. Maximal degree in co-relation 409. Up to 146 conditions per place. [2023-11-26 11:52:13,855 INFO L140 encePairwiseOnDemand]: 65/72 looper letters, 20 selfloop transitions, 6 changer transitions 0/55 dead transitions. [2023-11-26 11:52:13,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 55 transitions, 194 flow [2023-11-26 11:52:13,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:52:13,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 11:52:13,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2023-11-26 11:52:13,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-26 11:52:13,858 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 240 transitions. [2023-11-26 11:52:13,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 240 transitions. [2023-11-26 11:52:13,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:52:13,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 240 transitions. [2023-11-26 11:52:13,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:13,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:13,862 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:13,862 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 144 flow. Second operand 5 states and 240 transitions. [2023-11-26 11:52:13,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 55 transitions, 194 flow [2023-11-26 11:52:13,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 55 transitions, 180 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-26 11:52:13,865 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 140 flow [2023-11-26 11:52:13,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=140, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2023-11-26 11:52:13,866 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -12 predicate places. [2023-11-26 11:52:13,867 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 140 flow [2023-11-26 11:52:13,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:13,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:52:13,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:52:13,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 11:52:13,868 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-26 11:52:13,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:52:13,869 INFO L85 PathProgramCache]: Analyzing trace with hash 53080475, now seen corresponding path program 1 times [2023-11-26 11:52:13,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:52:13,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515551859] [2023-11-26 11:52:13,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:52:13,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:52:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:14,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:52:14,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:52:14,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515551859] [2023-11-26 11:52:14,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515551859] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:52:14,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:52:14,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:52:14,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708986805] [2023-11-26 11:52:14,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:52:14,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:52:14,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:52:14,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:52:14,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:52:14,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 72 [2023-11-26 11:52:14,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:14,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:52:14,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 72 [2023-11-26 11:52:14,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:52:14,366 INFO L124 PetriNetUnfolderBase]: 63/241 cut-off events. [2023-11-26 11:52:14,366 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-11-26 11:52:14,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 241 events. 63/241 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1123 event pairs, 62 based on Foata normal form. 1/201 useless extension candidates. Maximal degree in co-relation 406. Up to 146 conditions per place. [2023-11-26 11:52:14,369 INFO L140 encePairwiseOnDemand]: 65/72 looper letters, 22 selfloop transitions, 6 changer transitions 0/54 dead transitions. [2023-11-26 11:52:14,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 54 transitions, 194 flow [2023-11-26 11:52:14,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:52:14,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 11:52:14,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 232 transitions. [2023-11-26 11:52:14,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2023-11-26 11:52:14,371 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 232 transitions. [2023-11-26 11:52:14,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 232 transitions. [2023-11-26 11:52:14,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:52:14,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 232 transitions. [2023-11-26 11:52:14,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:14,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:14,374 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:14,374 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 140 flow. Second operand 5 states and 232 transitions. [2023-11-26 11:52:14,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 54 transitions, 194 flow [2023-11-26 11:52:14,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 54 transitions, 182 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-26 11:52:14,377 INFO L231 Difference]: Finished difference. Result has 62 places, 54 transitions, 138 flow [2023-11-26 11:52:14,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2023-11-26 11:52:14,378 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -13 predicate places. [2023-11-26 11:52:14,379 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 138 flow [2023-11-26 11:52:14,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:14,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:52:14,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:52:14,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 11:52:14,380 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-26 11:52:14,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:52:14,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1645495129, now seen corresponding path program 1 times [2023-11-26 11:52:14,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:52:14,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878093878] [2023-11-26 11:52:14,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:52:14,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:52:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:14,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:52:14,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:52:14,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878093878] [2023-11-26 11:52:14,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878093878] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:52:14,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:52:14,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:52:14,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940835219] [2023-11-26 11:52:14,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:52:14,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:52:14,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:52:14,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:52:14,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:52:14,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 72 [2023-11-26 11:52:14,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 48.333333333333336) internal successors, (290), 6 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:14,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:52:14,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 72 [2023-11-26 11:52:14,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:52:15,026 INFO L124 PetriNetUnfolderBase]: 63/242 cut-off events. [2023-11-26 11:52:15,026 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-11-26 11:52:15,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 242 events. 63/242 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1129 event pairs, 45 based on Foata normal form. 1/203 useless extension candidates. Maximal degree in co-relation 407. Up to 109 conditions per place. [2023-11-26 11:52:15,029 INFO L140 encePairwiseOnDemand]: 66/72 looper letters, 30 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2023-11-26 11:52:15,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 226 flow [2023-11-26 11:52:15,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:52:15,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 11:52:15,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 316 transitions. [2023-11-26 11:52:15,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7314814814814815 [2023-11-26 11:52:15,032 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 316 transitions. [2023-11-26 11:52:15,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 316 transitions. [2023-11-26 11:52:15,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:52:15,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 316 transitions. [2023-11-26 11:52:15,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 52.666666666666664) internal successors, (316), 6 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:15,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 72.0) internal successors, (504), 7 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:15,036 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 72.0) internal successors, (504), 7 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:15,036 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 138 flow. Second operand 6 states and 316 transitions. [2023-11-26 11:52:15,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 226 flow [2023-11-26 11:52:15,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 62 transitions, 214 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-26 11:52:15,039 INFO L231 Difference]: Finished difference. Result has 62 places, 53 transitions, 134 flow [2023-11-26 11:52:15,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=134, PETRI_PLACES=62, PETRI_TRANSITIONS=53} [2023-11-26 11:52:15,040 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -13 predicate places. [2023-11-26 11:52:15,040 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 134 flow [2023-11-26 11:52:15,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.333333333333336) internal successors, (290), 6 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:15,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:52:15,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:52:15,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 11:52:15,041 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-26 11:52:15,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:52:15,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1645495128, now seen corresponding path program 1 times [2023-11-26 11:52:15,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:52:15,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775997850] [2023-11-26 11:52:15,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:52:15,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:52:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:15,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:52:15,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:52:15,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775997850] [2023-11-26 11:52:15,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775997850] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:52:15,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:52:15,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:52:15,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346387151] [2023-11-26 11:52:15,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:52:15,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 11:52:15,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:52:15,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 11:52:15,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:52:15,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 72 [2023-11-26 11:52:15,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 134 flow. Second operand has 8 states, 8 states have (on average 44.375) internal successors, (355), 8 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:15,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:52:15,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 72 [2023-11-26 11:52:15,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:52:16,015 INFO L124 PetriNetUnfolderBase]: 63/241 cut-off events. [2023-11-26 11:52:16,016 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-26 11:52:16,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 241 events. 63/241 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1117 event pairs, 45 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 411. Up to 116 conditions per place. [2023-11-26 11:52:16,018 INFO L140 encePairwiseOnDemand]: 69/72 looper letters, 37 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-26 11:52:16,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 61 transitions, 230 flow [2023-11-26 11:52:16,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:52:16,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:52:16,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2023-11-26 11:52:16,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7731481481481481 [2023-11-26 11:52:16,021 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 167 transitions. [2023-11-26 11:52:16,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 167 transitions. [2023-11-26 11:52:16,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:52:16,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 167 transitions. [2023-11-26 11:52:16,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:16,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:16,024 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:16,024 INFO L175 Difference]: Start difference. First operand has 62 places, 53 transitions, 134 flow. Second operand 3 states and 167 transitions. [2023-11-26 11:52:16,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 61 transitions, 230 flow [2023-11-26 11:52:16,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 61 transitions, 220 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-26 11:52:16,028 INFO L231 Difference]: Finished difference. Result has 58 places, 52 transitions, 126 flow [2023-11-26 11:52:16,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=58, PETRI_TRANSITIONS=52} [2023-11-26 11:52:16,031 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -17 predicate places. [2023-11-26 11:52:16,032 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 52 transitions, 126 flow [2023-11-26 11:52:16,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 44.375) internal successors, (355), 8 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:16,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:52:16,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:52:16,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 11:52:16,034 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-26 11:52:16,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:52:16,035 INFO L85 PathProgramCache]: Analyzing trace with hash -883080720, now seen corresponding path program 1 times [2023-11-26 11:52:16,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:52:16,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649846231] [2023-11-26 11:52:16,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:52:16,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:52:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:16,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:52:16,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:52:16,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649846231] [2023-11-26 11:52:16,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649846231] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:52:16,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:52:16,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:52:16,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448653564] [2023-11-26 11:52:16,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:52:16,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:52:16,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:52:16,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:52:16,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:52:16,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 72 [2023-11-26 11:52:16,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 52 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:16,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:52:16,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 72 [2023-11-26 11:52:16,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:52:16,384 INFO L124 PetriNetUnfolderBase]: 63/248 cut-off events. [2023-11-26 11:52:16,384 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-26 11:52:16,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 248 events. 63/248 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1151 event pairs, 50 based on Foata normal form. 8/219 useless extension candidates. Maximal degree in co-relation 419. Up to 136 conditions per place. [2023-11-26 11:52:16,387 INFO L140 encePairwiseOnDemand]: 68/72 looper letters, 30 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2023-11-26 11:52:16,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 57 transitions, 207 flow [2023-11-26 11:52:16,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:52:16,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:52:16,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2023-11-26 11:52:16,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7916666666666666 [2023-11-26 11:52:16,389 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 171 transitions. [2023-11-26 11:52:16,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 171 transitions. [2023-11-26 11:52:16,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:52:16,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 171 transitions. [2023-11-26 11:52:16,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:16,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:16,392 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:16,392 INFO L175 Difference]: Start difference. First operand has 58 places, 52 transitions, 126 flow. Second operand 3 states and 171 transitions. [2023-11-26 11:52:16,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 57 transitions, 207 flow [2023-11-26 11:52:16,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 57 transitions, 201 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:52:16,395 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 124 flow [2023-11-26 11:52:16,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2023-11-26 11:52:16,396 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -19 predicate places. [2023-11-26 11:52:16,396 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 124 flow [2023-11-26 11:52:16,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:16,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:52:16,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:52:16,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 11:52:16,397 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-26 11:52:16,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:52:16,398 INFO L85 PathProgramCache]: Analyzing trace with hash -883080721, now seen corresponding path program 1 times [2023-11-26 11:52:16,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:52:16,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941769859] [2023-11-26 11:52:16,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:52:16,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:52:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:16,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:52:16,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:52:16,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941769859] [2023-11-26 11:52:16,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941769859] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:52:16,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:52:16,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:52:16,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576735637] [2023-11-26 11:52:16,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:52:16,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:52:16,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:52:16,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:52:16,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:52:16,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 72 [2023-11-26 11:52:16,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:16,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:52:16,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 72 [2023-11-26 11:52:16,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:52:16,674 INFO L124 PetriNetUnfolderBase]: 74/256 cut-off events. [2023-11-26 11:52:16,675 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2023-11-26 11:52:16,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 256 events. 74/256 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1153 event pairs, 53 based on Foata normal form. 8/231 useless extension candidates. Maximal degree in co-relation 468. Up to 148 conditions per place. [2023-11-26 11:52:16,677 INFO L140 encePairwiseOnDemand]: 66/72 looper letters, 33 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2023-11-26 11:52:16,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 59 transitions, 223 flow [2023-11-26 11:52:16,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:52:16,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:52:16,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2023-11-26 11:52:16,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8009259259259259 [2023-11-26 11:52:16,679 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 173 transitions. [2023-11-26 11:52:16,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 173 transitions. [2023-11-26 11:52:16,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:52:16,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 173 transitions. [2023-11-26 11:52:16,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:16,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:16,684 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:16,684 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 124 flow. Second operand 3 states and 173 transitions. [2023-11-26 11:52:16,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 59 transitions, 223 flow [2023-11-26 11:52:16,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 59 transitions, 215 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:52:16,689 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 155 flow [2023-11-26 11:52:16,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2023-11-26 11:52:16,691 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -17 predicate places. [2023-11-26 11:52:16,692 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 155 flow [2023-11-26 11:52:16,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:16,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:52:16,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:52:16,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 11:52:16,693 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-26 11:52:16,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:52:16,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1663200617, now seen corresponding path program 1 times [2023-11-26 11:52:16,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:52:16,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008032785] [2023-11-26 11:52:16,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:52:16,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:52:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:16,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:52:16,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:52:16,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008032785] [2023-11-26 11:52:16,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008032785] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:52:16,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:52:16,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:52:16,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591978616] [2023-11-26 11:52:16,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:52:16,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:52:16,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:52:16,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:52:16,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:52:17,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 72 [2023-11-26 11:52:17,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 155 flow. Second operand has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 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-26 11:52:17,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:52:17,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 72 [2023-11-26 11:52:17,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:52:17,260 INFO L124 PetriNetUnfolderBase]: 75/257 cut-off events. [2023-11-26 11:52:17,261 INFO L125 PetriNetUnfolderBase]: For 65/70 co-relation queries the response was YES. [2023-11-26 11:52:17,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 257 events. 75/257 cut-off events. For 65/70 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1136 event pairs, 45 based on Foata normal form. 1/233 useless extension candidates. Maximal degree in co-relation 509. Up to 106 conditions per place. [2023-11-26 11:52:17,263 INFO L140 encePairwiseOnDemand]: 65/72 looper letters, 41 selfloop transitions, 7 changer transitions 0/70 dead transitions. [2023-11-26 11:52:17,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 70 transitions, 305 flow [2023-11-26 11:52:17,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:52:17,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 11:52:17,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 303 transitions. [2023-11-26 11:52:17,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7013888888888888 [2023-11-26 11:52:17,266 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 303 transitions. [2023-11-26 11:52:17,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 303 transitions. [2023-11-26 11:52:17,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:52:17,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 303 transitions. [2023-11-26 11:52:17,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 50.5) internal successors, (303), 6 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:17,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 72.0) internal successors, (504), 7 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:17,269 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 72.0) internal successors, (504), 7 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:17,269 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 155 flow. Second operand 6 states and 303 transitions. [2023-11-26 11:52:17,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 70 transitions, 305 flow [2023-11-26 11:52:17,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 70 transitions, 287 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:52:17,272 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 157 flow [2023-11-26 11:52:17,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=157, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2023-11-26 11:52:17,273 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -15 predicate places. [2023-11-26 11:52:17,274 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 157 flow [2023-11-26 11:52:17,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 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-26 11:52:17,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:52:17,274 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:52:17,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 11:52:17,275 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-26 11:52:17,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:52:17,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1663200616, now seen corresponding path program 1 times [2023-11-26 11:52:17,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:52:17,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751622554] [2023-11-26 11:52:17,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:52:17,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:52:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:17,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:52:17,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:52:17,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751622554] [2023-11-26 11:52:17,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751622554] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:52:17,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:52:17,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 11:52:17,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683939138] [2023-11-26 11:52:17,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:52:17,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 11:52:17,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:52:17,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 11:52:17,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-26 11:52:18,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 72 [2023-11-26 11:52:18,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 157 flow. Second operand has 9 states, 9 states have (on average 44.44444444444444) internal successors, (400), 9 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:18,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:52:18,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 72 [2023-11-26 11:52:18,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:52:18,357 INFO L124 PetriNetUnfolderBase]: 74/243 cut-off events. [2023-11-26 11:52:18,357 INFO L125 PetriNetUnfolderBase]: For 52/56 co-relation queries the response was YES. [2023-11-26 11:52:18,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 243 events. 74/243 cut-off events. For 52/56 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1044 event pairs, 53 based on Foata normal form. 10/227 useless extension candidates. Maximal degree in co-relation 501. Up to 127 conditions per place. [2023-11-26 11:52:18,360 INFO L140 encePairwiseOnDemand]: 61/72 looper letters, 34 selfloop transitions, 11 changer transitions 3/69 dead transitions. [2023-11-26 11:52:18,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 69 transitions, 297 flow [2023-11-26 11:52:18,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 11:52:18,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-26 11:52:18,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 432 transitions. [2023-11-26 11:52:18,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-26 11:52:18,363 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 432 transitions. [2023-11-26 11:52:18,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 432 transitions. [2023-11-26 11:52:18,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:52:18,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 432 transitions. [2023-11-26 11:52:18,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 48.0) internal successors, (432), 9 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:18,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 72.0) internal successors, (720), 10 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-26 11:52:18,368 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 72.0) internal successors, (720), 10 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-26 11:52:18,368 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 157 flow. Second operand 9 states and 432 transitions. [2023-11-26 11:52:18,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 69 transitions, 297 flow [2023-11-26 11:52:18,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 69 transitions, 283 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-26 11:52:18,371 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 163 flow [2023-11-26 11:52:18,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=163, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-11-26 11:52:18,372 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -13 predicate places. [2023-11-26 11:52:18,372 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 163 flow [2023-11-26 11:52:18,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 44.44444444444444) internal successors, (400), 9 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:18,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:52:18,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:52:18,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 11:52:18,374 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-26 11:52:18,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:52:18,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1762963664, now seen corresponding path program 1 times [2023-11-26 11:52:18,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:52:18,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689332203] [2023-11-26 11:52:18,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:52:18,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:52:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:18,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:52:18,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:52:18,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689332203] [2023-11-26 11:52:18,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689332203] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:52:18,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:52:18,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 11:52:18,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270992857] [2023-11-26 11:52:18,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:52:18,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 11:52:18,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:52:18,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 11:52:18,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-26 11:52:19,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 72 [2023-11-26 11:52:19,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 163 flow. Second operand has 9 states, 9 states have (on average 42.55555555555556) internal successors, (383), 9 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-26 11:52:19,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:52:19,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 72 [2023-11-26 11:52:19,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:52:19,839 INFO L124 PetriNetUnfolderBase]: 75/250 cut-off events. [2023-11-26 11:52:19,839 INFO L125 PetriNetUnfolderBase]: For 57/61 co-relation queries the response was YES. [2023-11-26 11:52:19,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 250 events. 75/250 cut-off events. For 57/61 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1119 event pairs, 32 based on Foata normal form. 2/220 useless extension candidates. Maximal degree in co-relation 510. Up to 117 conditions per place. [2023-11-26 11:52:19,842 INFO L140 encePairwiseOnDemand]: 64/72 looper letters, 37 selfloop transitions, 9 changer transitions 0/66 dead transitions. [2023-11-26 11:52:19,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 66 transitions, 300 flow [2023-11-26 11:52:19,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:52:19,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 11:52:19,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 332 transitions. [2023-11-26 11:52:19,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6587301587301587 [2023-11-26 11:52:19,844 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 332 transitions. [2023-11-26 11:52:19,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 332 transitions. [2023-11-26 11:52:19,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:52:19,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 332 transitions. [2023-11-26 11:52:19,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 47.42857142857143) internal successors, (332), 7 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:19,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 72.0) internal successors, (576), 8 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:19,849 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 72.0) internal successors, (576), 8 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:19,849 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 163 flow. Second operand 7 states and 332 transitions. [2023-11-26 11:52:19,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 66 transitions, 300 flow [2023-11-26 11:52:19,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 66 transitions, 268 flow, removed 0 selfloop flow, removed 9 redundant places. [2023-11-26 11:52:19,852 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 156 flow [2023-11-26 11:52:19,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=156, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2023-11-26 11:52:19,853 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -18 predicate places. [2023-11-26 11:52:19,853 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 156 flow [2023-11-26 11:52:19,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 42.55555555555556) internal successors, (383), 9 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-26 11:52:19,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:52:19,854 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:52:19,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 11:52:19,855 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-26 11:52:19,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:52:19,855 INFO L85 PathProgramCache]: Analyzing trace with hash -19611180, now seen corresponding path program 1 times [2023-11-26 11:52:19,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:52:19,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097564860] [2023-11-26 11:52:19,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:52:19,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:52:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:20,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:52:20,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:52:20,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097564860] [2023-11-26 11:52:20,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097564860] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:52:20,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:52:20,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-26 11:52:20,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697777128] [2023-11-26 11:52:20,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:52:20,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-26 11:52:20,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:52:20,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-26 11:52:20,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-11-26 11:52:22,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 72 [2023-11-26 11:52:22,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 156 flow. Second operand has 12 states, 12 states have (on average 33.333333333333336) internal successors, (400), 12 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:22,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:52:22,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 72 [2023-11-26 11:52:22,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:52:22,989 INFO L124 PetriNetUnfolderBase]: 125/369 cut-off events. [2023-11-26 11:52:22,989 INFO L125 PetriNetUnfolderBase]: For 76/78 co-relation queries the response was YES. [2023-11-26 11:52:22,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 369 events. 125/369 cut-off events. For 76/78 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1763 event pairs, 46 based on Foata normal form. 0/335 useless extension candidates. Maximal degree in co-relation 753. Up to 167 conditions per place. [2023-11-26 11:52:22,993 INFO L140 encePairwiseOnDemand]: 60/72 looper letters, 56 selfloop transitions, 16 changer transitions 0/85 dead transitions. [2023-11-26 11:52:22,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 85 transitions, 414 flow [2023-11-26 11:52:22,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-26 11:52:22,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-26 11:52:22,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 416 transitions. [2023-11-26 11:52:22,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5252525252525253 [2023-11-26 11:52:22,997 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 416 transitions. [2023-11-26 11:52:22,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 416 transitions. [2023-11-26 11:52:22,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:52:22,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 416 transitions. [2023-11-26 11:52:22,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 37.81818181818182) internal successors, (416), 11 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:23,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 72.0) internal successors, (864), 12 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:23,002 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 72.0) internal successors, (864), 12 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:23,003 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 156 flow. Second operand 11 states and 416 transitions. [2023-11-26 11:52:23,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 85 transitions, 414 flow [2023-11-26 11:52:23,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 85 transitions, 407 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-26 11:52:23,007 INFO L231 Difference]: Finished difference. Result has 69 places, 59 transitions, 237 flow [2023-11-26 11:52:23,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=237, PETRI_PLACES=69, PETRI_TRANSITIONS=59} [2023-11-26 11:52:23,008 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -6 predicate places. [2023-11-26 11:52:23,008 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 59 transitions, 237 flow [2023-11-26 11:52:23,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 33.333333333333336) internal successors, (400), 12 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:23,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:52:23,009 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:52:23,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 11:52:23,009 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-26 11:52:23,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:52:23,010 INFO L85 PathProgramCache]: Analyzing trace with hash -19611181, now seen corresponding path program 1 times [2023-11-26 11:52:23,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:52:23,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875391119] [2023-11-26 11:52:23,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:52:23,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:52:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:23,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:52:23,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:52:23,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875391119] [2023-11-26 11:52:23,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875391119] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:52:23,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:52:23,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-26 11:52:23,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528283999] [2023-11-26 11:52:23,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:52:23,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-26 11:52:23,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:52:23,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-26 11:52:23,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2023-11-26 11:52:25,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 72 [2023-11-26 11:52:25,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 59 transitions, 237 flow. Second operand has 14 states, 14 states have (on average 37.142857142857146) internal successors, (520), 14 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:25,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:52:25,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 72 [2023-11-26 11:52:25,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:52:25,985 INFO L124 PetriNetUnfolderBase]: 125/358 cut-off events. [2023-11-26 11:52:25,986 INFO L125 PetriNetUnfolderBase]: For 154/155 co-relation queries the response was YES. [2023-11-26 11:52:25,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 358 events. 125/358 cut-off events. For 154/155 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1683 event pairs, 33 based on Foata normal form. 0/325 useless extension candidates. Maximal degree in co-relation 839. Up to 162 conditions per place. [2023-11-26 11:52:25,989 INFO L140 encePairwiseOnDemand]: 59/72 looper letters, 51 selfloop transitions, 18 changer transitions 0/82 dead transitions. [2023-11-26 11:52:25,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 82 transitions, 453 flow [2023-11-26 11:52:25,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-26 11:52:25,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-26 11:52:25,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 456 transitions. [2023-11-26 11:52:25,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2023-11-26 11:52:25,993 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 456 transitions. [2023-11-26 11:52:25,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 456 transitions. [2023-11-26 11:52:25,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:52:25,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 456 transitions. [2023-11-26 11:52:25,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 41.45454545454545) internal successors, (456), 11 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:25,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 72.0) internal successors, (864), 12 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:25,998 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 72.0) internal successors, (864), 12 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:25,998 INFO L175 Difference]: Start difference. First operand has 69 places, 59 transitions, 237 flow. Second operand 11 states and 456 transitions. [2023-11-26 11:52:25,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 82 transitions, 453 flow [2023-11-26 11:52:26,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 82 transitions, 439 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-11-26 11:52:26,003 INFO L231 Difference]: Finished difference. Result has 77 places, 63 transitions, 307 flow [2023-11-26 11:52:26,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=307, PETRI_PLACES=77, PETRI_TRANSITIONS=63} [2023-11-26 11:52:26,004 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 2 predicate places. [2023-11-26 11:52:26,004 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 63 transitions, 307 flow [2023-11-26 11:52:26,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 37.142857142857146) internal successors, (520), 14 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:26,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:52:26,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:52:26,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 11:52:26,005 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-26 11:52:26,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:52:26,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1307297990, now seen corresponding path program 1 times [2023-11-26 11:52:26,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:52:26,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041966907] [2023-11-26 11:52:26,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:52:26,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:52:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:26,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:52:26,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:52:26,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041966907] [2023-11-26 11:52:26,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041966907] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:52:26,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:52:26,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:52:26,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148350586] [2023-11-26 11:52:26,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:52:26,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:52:26,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:52:26,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:52:26,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:52:26,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 72 [2023-11-26 11:52:26,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 63 transitions, 307 flow. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:26,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:52:26,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 72 [2023-11-26 11:52:26,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:52:26,219 INFO L124 PetriNetUnfolderBase]: 42/185 cut-off events. [2023-11-26 11:52:26,219 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2023-11-26 11:52:26,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 185 events. 42/185 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 690 event pairs, 6 based on Foata normal form. 9/174 useless extension candidates. Maximal degree in co-relation 451. Up to 72 conditions per place. [2023-11-26 11:52:26,221 INFO L140 encePairwiseOnDemand]: 68/72 looper letters, 37 selfloop transitions, 4 changer transitions 2/69 dead transitions. [2023-11-26 11:52:26,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 69 transitions, 423 flow [2023-11-26 11:52:26,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:52:26,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:52:26,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2023-11-26 11:52:26,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8101851851851852 [2023-11-26 11:52:26,223 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 175 transitions. [2023-11-26 11:52:26,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 175 transitions. [2023-11-26 11:52:26,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:52:26,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 175 transitions. [2023-11-26 11:52:26,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:26,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:26,225 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:26,226 INFO L175 Difference]: Start difference. First operand has 77 places, 63 transitions, 307 flow. Second operand 3 states and 175 transitions. [2023-11-26 11:52:26,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 69 transitions, 423 flow [2023-11-26 11:52:26,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 69 transitions, 392 flow, removed 2 selfloop flow, removed 9 redundant places. [2023-11-26 11:52:26,229 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 270 flow [2023-11-26 11:52:26,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2023-11-26 11:52:26,231 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -5 predicate places. [2023-11-26 11:52:26,231 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 270 flow [2023-11-26 11:52:26,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:26,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:52:26,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:52:26,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-26 11:52:26,232 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-26 11:52:26,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:52:26,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1182700826, now seen corresponding path program 1 times [2023-11-26 11:52:26,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:52:26,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173653319] [2023-11-26 11:52:26,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:52:26,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:52:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:52:26,330 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:52:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:52:26,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:52:26,431 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:52:26,432 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 52 remaining) [2023-11-26 11:52:26,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 52 remaining) [2023-11-26 11:52:26,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 52 remaining) [2023-11-26 11:52:26,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 52 remaining) [2023-11-26 11:52:26,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 52 remaining) [2023-11-26 11:52:26,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 52 remaining) [2023-11-26 11:52:26,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 52 remaining) [2023-11-26 11:52:26,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 52 remaining) [2023-11-26 11:52:26,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 52 remaining) [2023-11-26 11:52:26,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 52 remaining) [2023-11-26 11:52:26,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 52 remaining) [2023-11-26 11:52:26,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 52 remaining) [2023-11-26 11:52:26,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 52 remaining) [2023-11-26 11:52:26,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 52 remaining) [2023-11-26 11:52:26,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 52 remaining) [2023-11-26 11:52:26,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 52 remaining) [2023-11-26 11:52:26,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 52 remaining) [2023-11-26 11:52:26,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 52 remaining) [2023-11-26 11:52:26,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 52 remaining) [2023-11-26 11:52:26,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 52 remaining) [2023-11-26 11:52:26,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 52 remaining) [2023-11-26 11:52:26,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 52 remaining) [2023-11-26 11:52:26,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 52 remaining) [2023-11-26 11:52:26,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 52 remaining) [2023-11-26 11:52:26,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 52 remaining) [2023-11-26 11:52:26,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 52 remaining) [2023-11-26 11:52:26,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 52 remaining) [2023-11-26 11:52:26,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (24 of 52 remaining) [2023-11-26 11:52:26,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 52 remaining) [2023-11-26 11:52:26,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 52 remaining) [2023-11-26 11:52:26,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 52 remaining) [2023-11-26 11:52:26,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 52 remaining) [2023-11-26 11:52:26,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 52 remaining) [2023-11-26 11:52:26,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 52 remaining) [2023-11-26 11:52:26,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 52 remaining) [2023-11-26 11:52:26,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 52 remaining) [2023-11-26 11:52:26,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 52 remaining) [2023-11-26 11:52:26,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 52 remaining) [2023-11-26 11:52:26,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 52 remaining) [2023-11-26 11:52:26,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 52 remaining) [2023-11-26 11:52:26,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 52 remaining) [2023-11-26 11:52:26,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 52 remaining) [2023-11-26 11:52:26,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 52 remaining) [2023-11-26 11:52:26,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 52 remaining) [2023-11-26 11:52:26,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 52 remaining) [2023-11-26 11:52:26,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 52 remaining) [2023-11-26 11:52:26,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 52 remaining) [2023-11-26 11:52:26,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 52 remaining) [2023-11-26 11:52:26,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 52 remaining) [2023-11-26 11:52:26,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 52 remaining) [2023-11-26 11:52:26,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 52 remaining) [2023-11-26 11:52:26,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 52 remaining) [2023-11-26 11:52:26,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-26 11:52:26,446 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:52:26,453 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 11:52:26,454 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 11:52:26,482 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre41 could not be translated [2023-11-26 11:52:26,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:52:26 BasicIcfg [2023-11-26 11:52:26,493 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 11:52:26,494 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:52:26,494 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:52:26,494 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:52:26,494 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:52:08" (3/4) ... [2023-11-26 11:52:26,495 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-26 11:52:26,510 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre41 could not be translated [2023-11-26 11:52:26,549 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c7d3b8-bb12-4d71-895b-3e4344479b71/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 11:52:26,549 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:52:26,550 INFO L158 Benchmark]: Toolchain (without parser) took 20171.77ms. Allocated memory was 165.7MB in the beginning and 287.3MB in the end (delta: 121.6MB). Free memory was 138.2MB in the beginning and 96.4MB in the end (delta: 41.8MB). Peak memory consumption was 162.4MB. Max. memory is 16.1GB. [2023-11-26 11:52:26,550 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 113.2MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:52:26,550 INFO L158 Benchmark]: CACSL2BoogieTranslator took 984.81ms. Allocated memory is still 165.7MB. Free memory was 138.2MB in the beginning and 98.4MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2023-11-26 11:52:26,551 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.95ms. Allocated memory is still 165.7MB. Free memory was 98.4MB in the beginning and 95.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:52:26,551 INFO L158 Benchmark]: Boogie Preprocessor took 89.58ms. Allocated memory is still 165.7MB. Free memory was 95.2MB in the beginning and 92.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 11:52:26,551 INFO L158 Benchmark]: RCFGBuilder took 1017.06ms. Allocated memory is still 165.7MB. Free memory was 92.1MB in the beginning and 128.3MB in the end (delta: -36.2MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. [2023-11-26 11:52:26,552 INFO L158 Benchmark]: TraceAbstraction took 17937.61ms. Allocated memory was 165.7MB in the beginning and 287.3MB in the end (delta: 121.6MB). Free memory was 127.2MB in the beginning and 101.6MB in the end (delta: 25.6MB). Peak memory consumption was 148.3MB. Max. memory is 16.1GB. [2023-11-26 11:52:26,552 INFO L158 Benchmark]: Witness Printer took 55.45ms. Allocated memory is still 287.3MB. Free memory was 101.6MB in the beginning and 96.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 11:52:26,554 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 113.2MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 984.81ms. Allocated memory is still 165.7MB. Free memory was 138.2MB in the beginning and 98.4MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.95ms. Allocated memory is still 165.7MB. Free memory was 98.4MB in the beginning and 95.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.58ms. Allocated memory is still 165.7MB. Free memory was 95.2MB in the beginning and 92.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1017.06ms. Allocated memory is still 165.7MB. Free memory was 92.1MB in the beginning and 128.3MB in the end (delta: -36.2MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17937.61ms. Allocated memory was 165.7MB in the beginning and 287.3MB in the end (delta: 121.6MB). Free memory was 127.2MB in the beginning and 101.6MB in the end (delta: 25.6MB). Peak memory consumption was 148.3MB. Max. memory is 16.1GB. * Witness Printer took 55.45ms. Allocated memory is still 287.3MB. Free memory was 101.6MB in the beginning and 96.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre41 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre41 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1243] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1254] 0 int j = __VERIFIER_nondet_int(); [L1255] CALL 0 assume_abort_if_not(0 <= j && j < 10) [L11] COND FALSE 0 !(!cond) [L1255] RET 0 assume_abort_if_not(0 <= j && j < 10) [L1256] 0 pthread_t t1; [L1257] 0 struct s *p; [L1258] CALL, EXPR 0 new(1) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1258] RET, EXPR 0 new(1) [L1258] 0 slot[j] = new(1) [L1259] CALL, EXPR 0 new(2) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1259] RET, EXPR 0 new(2) [L1259] EXPR 0 slot[j] [L1259] CALL 0 list_add(new(2), slot[j]) [L1239] EXPR 0 list->next [L1239] 0 struct s *temp = list->next; [L1240] 0 list->next = node VAL [mutex={1:0}, slot={2:0}] [L1241] 0 node->next = temp [L1259] RET 0 list_add(new(2), slot[j]) [L1260] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [j=9, mutex={1:0}, slot={2:0}, t1={9:0}] [L1246] 1 int i = __VERIFIER_nondet_int(); [L1247] CALL 1 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 1 !(!cond) [L1247] RET 1 assume_abort_if_not(0 <= i && i < 10) [L1249] CALL, EXPR 1 new(3) [L1233] 1 struct s *p = malloc(sizeof(struct s)); [L1234] 1 p->datum = x VAL [arg={0:0}, arg={0:0}, i=8, mutex={1:0}, slot={2:0}] [L1235] 1 p->next = ((void *)0) [L1236] 1 return p; [L1249] RET, EXPR 1 new(3) [L1249] EXPR 1 slot[i] [L1249] CALL 1 list_add(new(3), slot[i]) [L1239] 1 list->next - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1253]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1260]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 98 locations, 52 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.8s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3927 SdHoareTripleChecker+Valid, 9.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2857 mSDsluCounter, 1871 SdHoareTripleChecker+Invalid, 7.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1639 mSDsCounter, 149 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10739 IncrementalHoareTripleChecker+Invalid, 10888 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 149 mSolverCounterUnsat, 232 mSDtfsCounter, 10739 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=307occurred in iteration=17, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 191 ConstructedInterpolants, 0 QuantifiedInterpolants, 2425 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-26 11:52:26,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c7d3b8-bb12-4d71-895b-3e4344479b71/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)