./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml', '-i', '../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr-deref.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G valid-free) )\nCHECK( init(main()), LTL(G valid-deref) )\nCHECK( init(main()), LTL(G valid-memtrack) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'e8cd6f4fedd4ae62debc23b5e2621fa19163a924ac1cc7b32aeb6e38c2fa5ce1'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr-deref.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --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 e8cd6f4fedd4ae62debc23b5e2621fa19163a924ac1cc7b32aeb6e38c2fa5ce1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:23:01,146 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:23:01,244 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-07 19:23:01,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:23:01,251 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:23:01,278 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:23:01,280 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:23:01,280 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:23:01,281 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:23:01,281 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:23:01,281 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:23:01,281 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:23:01,282 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:23:01,282 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:23:01,282 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:23:01,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:23:01,283 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:23:01,283 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:23:01,283 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:23:01,283 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:23:01,283 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 19:23:01,283 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 19:23:01,283 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 19:23:01,283 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:23:01,283 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:23:01,283 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:23:01,283 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:23:01,283 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:23:01,283 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:23:01,283 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:23:01,283 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:23:01,283 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:23:01,283 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:23:01,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:23:01,284 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:23:01,284 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:23:01,284 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 19:23:01,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 19:23:01,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:23:01,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:23:01,285 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:23:01,285 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:23:01,285 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux 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 -> e8cd6f4fedd4ae62debc23b5e2621fa19163a924ac1cc7b32aeb6e38c2fa5ce1 [2024-11-07 19:23:01,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:23:01,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:23:01,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:23:01,589 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:23:01,589 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:23:01,592 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr-deref.i [2024-11-07 19:23:02,869 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:23:03,227 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:23:03,228 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr-deref.i [2024-11-07 19:23:03,254 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4dbe38a63/7ba867c6d9b24434bca3687de4039a90/FLAG9446671ac [2024-11-07 19:23:03,273 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4dbe38a63/7ba867c6d9b24434bca3687de4039a90 [2024-11-07 19:23:03,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:23:03,277 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:23:03,279 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:23:03,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:23:03,284 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:23:03,285 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:23:03" (1/1) ... [2024-11-07 19:23:03,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55dcadbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:23:03, skipping insertion in model container [2024-11-07 19:23:03,287 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:23:03" (1/1) ... [2024-11-07 19:23:03,330 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:23:03,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:23:03,779 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:23:03,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:23:03,923 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:23:03,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:23:03 WrapperNode [2024-11-07 19:23:03,923 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:23:03,924 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:23:03,924 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:23:03,924 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:23:03,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:23:03" (1/1) ... [2024-11-07 19:23:03,948 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:23:03" (1/1) ... [2024-11-07 19:23:03,975 INFO L138 Inliner]: procedures = 372, calls = 100, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 260 [2024-11-07 19:23:03,976 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:23:03,976 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:23:03,976 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:23:03,977 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:23:03,985 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:23:03" (1/1) ... [2024-11-07 19:23:03,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:23:03" (1/1) ... [2024-11-07 19:23:04,004 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:23:03" (1/1) ... [2024-11-07 19:23:04,032 INFO L175 MemorySlicer]: Split 99 memory accesses to 3 slices as follows [50, 18, 31]. 51 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [50, 10, 0]. The 26 writes are split as follows [0, 2, 24]. [2024-11-07 19:23:04,033 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:23:03" (1/1) ... [2024-11-07 19:23:04,033 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:23:03" (1/1) ... [2024-11-07 19:23:04,051 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:23:03" (1/1) ... [2024-11-07 19:23:04,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:23:03" (1/1) ... [2024-11-07 19:23:04,068 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:23:03" (1/1) ... [2024-11-07 19:23:04,070 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:23:03" (1/1) ... [2024-11-07 19:23:04,077 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:23:04,078 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:23:04,078 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:23:04,078 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:23:04,079 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:23:03" (1/1) ... [2024-11-07 19:23:04,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:23:04,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:23:04,116 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 19:23:04,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 19:23:04,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 19:23:04,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 19:23:04,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-07 19:23:04,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-07 19:23:04,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-07 19:23:04,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-07 19:23:04,140 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-07 19:23:04,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 19:23:04,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 19:23:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 19:23:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 19:23:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 19:23:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 19:23:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-07 19:23:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 19:23:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:23:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 19:23:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 19:23:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 19:23:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-07 19:23:04,142 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-07 19:23:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 19:23:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 19:23:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 19:23:04,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:23:04,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:23:04,145 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-07 19:23:04,323 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:23:04,325 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:23:04,973 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 19:23:04,974 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:23:05,443 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:23:05,445 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 19:23:05,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:23:05 BoogieIcfgContainer [2024-11-07 19:23:05,445 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:23:05,447 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:23:05,447 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:23:05,452 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:23:05,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:23:03" (1/3) ... [2024-11-07 19:23:05,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772d6f3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:23:05, skipping insertion in model container [2024-11-07 19:23:05,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:23:03" (2/3) ... [2024-11-07 19:23:05,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772d6f3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:23:05, skipping insertion in model container [2024-11-07 19:23:05,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:23:05" (3/3) ... [2024-11-07 19:23:05,454 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_13-arraycollapse_nr-deref.i [2024-11-07 19:23:05,468 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:23:05,468 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 79 error locations. [2024-11-07 19:23:05,469 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 19:23:05,543 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 19:23:05,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 134 transitions, 272 flow [2024-11-07 19:23:05,636 INFO L124 PetriNetUnfolderBase]: 1/133 cut-off events. [2024-11-07 19:23:05,638 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:23:05,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 133 events. 1/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 269 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2024-11-07 19:23:05,641 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 134 transitions, 272 flow [2024-11-07 19:23:05,645 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 133 transitions, 269 flow [2024-11-07 19:23:05,651 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:23:05,662 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@27d15589, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:23:05,662 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2024-11-07 19:23:05,686 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:23:05,686 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-07 19:23:05,686 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:23:05,686 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:05,687 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-07 19:23:05,687 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 19:23:05,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:05,691 INFO L85 PathProgramCache]: Analyzing trace with hash 759128, now seen corresponding path program 1 times [2024-11-07 19:23:05,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:05,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832591163] [2024-11-07 19:23:05,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:05,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:06,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:23:06,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:06,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832591163] [2024-11-07 19:23:06,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832591163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:06,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:06,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:23:06,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782137042] [2024-11-07 19:23:06,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:06,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:23:06,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:06,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:23:06,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:23:06,051 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 134 [2024-11-07 19:23:06,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 133 transitions, 269 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:06,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:06,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 134 [2024-11-07 19:23:06,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:06,275 INFO L124 PetriNetUnfolderBase]: 64/329 cut-off events. [2024-11-07 19:23:06,276 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:23:06,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501 conditions, 329 events. 64/329 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1306 event pairs, 63 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 376. Up to 167 conditions per place. [2024-11-07 19:23:06,279 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 39 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2024-11-07 19:23:06,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 134 transitions, 353 flow [2024-11-07 19:23:06,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:23:06,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:23:06,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2024-11-07 19:23:06,296 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8059701492537313 [2024-11-07 19:23:06,297 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 269 flow. Second operand 3 states and 324 transitions. [2024-11-07 19:23:06,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 134 transitions, 353 flow [2024-11-07 19:23:06,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 134 transitions, 352 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:23:06,307 INFO L231 Difference]: Finished difference. Result has 138 places, 134 transitions, 280 flow [2024-11-07 19:23:06,310 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=280, PETRI_PLACES=138, PETRI_TRANSITIONS=134} [2024-11-07 19:23:06,314 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 2 predicate places. [2024-11-07 19:23:06,315 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 134 transitions, 280 flow [2024-11-07 19:23:06,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:06,317 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:06,317 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-07 19:23:06,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 19:23:06,317 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 19:23:06,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:06,318 INFO L85 PathProgramCache]: Analyzing trace with hash 23529062, now seen corresponding path program 1 times [2024-11-07 19:23:06,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:06,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361499532] [2024-11-07 19:23:06,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:06,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:06,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:23:06,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:06,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361499532] [2024-11-07 19:23:06,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361499532] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:23:06,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811052373] [2024-11-07 19:23:06,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:06,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:23:06,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:23:06,463 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 19:23:06,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 19:23:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:06,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:23:06,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:23:06,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:23:06,626 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:23:06,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:23:06,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811052373] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:23:06,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 19:23:06,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-07 19:23:06,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209492935] [2024-11-07 19:23:06,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 19:23:06,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 19:23:06,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:06,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 19:23:06,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:23:06,650 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 134 [2024-11-07 19:23:06,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 134 transitions, 280 flow. Second operand has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:06,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:06,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 134 [2024-11-07 19:23:06,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:06,890 INFO L124 PetriNetUnfolderBase]: 64/332 cut-off events. [2024-11-07 19:23:06,890 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:23:06,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 332 events. 64/332 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1303 event pairs, 63 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 505. Up to 167 conditions per place. [2024-11-07 19:23:06,895 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 39 selfloop transitions, 5 changer transitions 0/137 dead transitions. [2024-11-07 19:23:06,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 137 transitions, 380 flow [2024-11-07 19:23:06,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:23:06,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:23:06,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 611 transitions. [2024-11-07 19:23:06,899 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7599502487562189 [2024-11-07 19:23:06,899 INFO L175 Difference]: Start difference. First operand has 138 places, 134 transitions, 280 flow. Second operand 6 states and 611 transitions. [2024-11-07 19:23:06,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 137 transitions, 380 flow [2024-11-07 19:23:06,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 137 transitions, 376 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-07 19:23:06,905 INFO L231 Difference]: Finished difference. Result has 145 places, 137 transitions, 312 flow [2024-11-07 19:23:06,906 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=145, PETRI_TRANSITIONS=137} [2024-11-07 19:23:06,907 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 9 predicate places. [2024-11-07 19:23:06,907 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 137 transitions, 312 flow [2024-11-07 19:23:06,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:06,908 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:06,908 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2024-11-07 19:23:06,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 19:23:07,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:23:07,109 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 19:23:07,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:07,110 INFO L85 PathProgramCache]: Analyzing trace with hash 870738136, now seen corresponding path program 2 times [2024-11-07 19:23:07,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:07,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573427975] [2024-11-07 19:23:07,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:07,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:07,252 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-07 19:23:07,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:07,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573427975] [2024-11-07 19:23:07,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573427975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:07,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:07,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:23:07,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801310397] [2024-11-07 19:23:07,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:07,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:23:07,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:07,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:23:07,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:23:07,385 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 134 [2024-11-07 19:23:07,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 137 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 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) [2024-11-07 19:23:07,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:07,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 134 [2024-11-07 19:23:07,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:07,532 INFO L124 PetriNetUnfolderBase]: 64/320 cut-off events. [2024-11-07 19:23:07,532 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 19:23:07,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 320 events. 64/320 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1245 event pairs, 63 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 490. Up to 165 conditions per place. [2024-11-07 19:23:07,537 INFO L140 encePairwiseOnDemand]: 110/134 looper letters, 38 selfloop transitions, 12 changer transitions 0/125 dead transitions. [2024-11-07 19:23:07,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 125 transitions, 388 flow [2024-11-07 19:23:07,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:23:07,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:23:07,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2024-11-07 19:23:07,541 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7114427860696517 [2024-11-07 19:23:07,541 INFO L175 Difference]: Start difference. First operand has 145 places, 137 transitions, 312 flow. Second operand 3 states and 286 transitions. [2024-11-07 19:23:07,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 125 transitions, 388 flow [2024-11-07 19:23:07,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 125 transitions, 374 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-11-07 19:23:07,545 INFO L231 Difference]: Finished difference. Result has 134 places, 125 transitions, 298 flow [2024-11-07 19:23:07,546 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=134, PETRI_TRANSITIONS=125} [2024-11-07 19:23:07,547 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -2 predicate places. [2024-11-07 19:23:07,547 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 125 transitions, 298 flow [2024-11-07 19:23:07,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 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) [2024-11-07 19:23:07,548 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:07,548 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2024-11-07 19:23:07,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 19:23:07,548 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 19:23:07,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:07,549 INFO L85 PathProgramCache]: Analyzing trace with hash 870738137, now seen corresponding path program 1 times [2024-11-07 19:23:07,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:07,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816961948] [2024-11-07 19:23:07,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:07,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:07,729 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:23:07,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:07,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816961948] [2024-11-07 19:23:07,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816961948] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:23:07,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122011297] [2024-11-07 19:23:07,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:07,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:23:07,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:23:07,733 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 19:23:07,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 19:23:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:07,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 19:23:07,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:23:07,870 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:23:07,870 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:23:07,935 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:23:07,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122011297] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:23:07,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 19:23:07,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-07 19:23:07,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010657208] [2024-11-07 19:23:07,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 19:23:07,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 19:23:07,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:07,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 19:23:07,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-07 19:23:07,939 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 134 [2024-11-07 19:23:07,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 125 transitions, 298 flow. Second operand has 13 states, 13 states have (on average 95.07692307692308) internal successors, (1236), 13 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:07,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:07,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 134 [2024-11-07 19:23:07,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:08,093 INFO L124 PetriNetUnfolderBase]: 64/326 cut-off events. [2024-11-07 19:23:08,093 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-11-07 19:23:08,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 326 events. 64/326 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1242 event pairs, 63 based on Foata normal form. 6/254 useless extension candidates. Maximal degree in co-relation 496. Up to 167 conditions per place. [2024-11-07 19:23:08,096 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 39 selfloop transitions, 11 changer transitions 0/131 dead transitions. [2024-11-07 19:23:08,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 131 transitions, 434 flow [2024-11-07 19:23:08,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 19:23:08,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-07 19:23:08,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1184 transitions. [2024-11-07 19:23:08,100 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.736318407960199 [2024-11-07 19:23:08,100 INFO L175 Difference]: Start difference. First operand has 134 places, 125 transitions, 298 flow. Second operand 12 states and 1184 transitions. [2024-11-07 19:23:08,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 131 transitions, 434 flow [2024-11-07 19:23:08,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 131 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:23:08,104 INFO L231 Difference]: Finished difference. Result has 149 places, 131 transitions, 358 flow [2024-11-07 19:23:08,104 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=358, PETRI_PLACES=149, PETRI_TRANSITIONS=131} [2024-11-07 19:23:08,105 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 13 predicate places. [2024-11-07 19:23:08,105 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 131 transitions, 358 flow [2024-11-07 19:23:08,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 95.07692307692308) internal successors, (1236), 13 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:08,106 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:08,106 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1] [2024-11-07 19:23:08,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 19:23:08,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:23:08,307 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 19:23:08,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:08,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1916526105, now seen corresponding path program 2 times [2024-11-07 19:23:08,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:08,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364996232] [2024-11-07 19:23:08,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:08,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:08,483 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:08,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:08,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364996232] [2024-11-07 19:23:08,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364996232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:08,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:08,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:23:08,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147371688] [2024-11-07 19:23:08,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:08,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:23:08,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:08,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:23:08,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:23:08,634 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 134 [2024-11-07 19:23:08,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 131 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:08,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:08,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 134 [2024-11-07 19:23:08,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:08,775 INFO L124 PetriNetUnfolderBase]: 64/314 cut-off events. [2024-11-07 19:23:08,775 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-11-07 19:23:08,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 553 conditions, 314 events. 64/314 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1211 event pairs, 63 based on Foata normal form. 6/248 useless extension candidates. Maximal degree in co-relation 478. Up to 171 conditions per place. [2024-11-07 19:23:08,778 INFO L140 encePairwiseOnDemand]: 110/134 looper letters, 38 selfloop transitions, 12 changer transitions 0/119 dead transitions. [2024-11-07 19:23:08,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 119 transitions, 434 flow [2024-11-07 19:23:08,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:23:08,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:23:08,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2024-11-07 19:23:08,780 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2024-11-07 19:23:08,780 INFO L175 Difference]: Start difference. First operand has 149 places, 131 transitions, 358 flow. Second operand 3 states and 298 transitions. [2024-11-07 19:23:08,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 119 transitions, 434 flow [2024-11-07 19:23:08,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 119 transitions, 386 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-11-07 19:23:08,784 INFO L231 Difference]: Finished difference. Result has 134 places, 119 transitions, 310 flow [2024-11-07 19:23:08,785 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=134, PETRI_TRANSITIONS=119} [2024-11-07 19:23:08,785 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -2 predicate places. [2024-11-07 19:23:08,785 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 119 transitions, 310 flow [2024-11-07 19:23:08,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:08,786 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:08,786 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2024-11-07 19:23:08,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 19:23:08,786 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 19:23:08,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:08,787 INFO L85 PathProgramCache]: Analyzing trace with hash -759359403, now seen corresponding path program 1 times [2024-11-07 19:23:08,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:08,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495460155] [2024-11-07 19:23:08,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:08,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:09,007 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:09,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:09,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495460155] [2024-11-07 19:23:09,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495460155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:09,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:09,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:23:09,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061203979] [2024-11-07 19:23:09,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:09,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:23:09,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:09,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:23:09,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:23:09,363 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 134 [2024-11-07 19:23:09,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 119 transitions, 310 flow. Second operand has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:09,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:09,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 134 [2024-11-07 19:23:09,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:09,477 INFO L124 PetriNetUnfolderBase]: 73/332 cut-off events. [2024-11-07 19:23:09,477 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-11-07 19:23:09,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 332 events. 73/332 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1334 event pairs, 72 based on Foata normal form. 2/270 useless extension candidates. Maximal degree in co-relation 533. Up to 201 conditions per place. [2024-11-07 19:23:09,480 INFO L140 encePairwiseOnDemand]: 125/134 looper letters, 56 selfloop transitions, 1 changer transitions 0/111 dead transitions. [2024-11-07 19:23:09,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 111 transitions, 408 flow [2024-11-07 19:23:09,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:23:09,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:23:09,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2024-11-07 19:23:09,488 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2024-11-07 19:23:09,488 INFO L175 Difference]: Start difference. First operand has 134 places, 119 transitions, 310 flow. Second operand 3 states and 292 transitions. [2024-11-07 19:23:09,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 111 transitions, 408 flow [2024-11-07 19:23:09,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 111 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:23:09,497 INFO L231 Difference]: Finished difference. Result has 126 places, 111 transitions, 272 flow [2024-11-07 19:23:09,498 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=126, PETRI_TRANSITIONS=111} [2024-11-07 19:23:09,499 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -10 predicate places. [2024-11-07 19:23:09,499 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 111 transitions, 272 flow [2024-11-07 19:23:09,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:09,500 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:09,500 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2024-11-07 19:23:09,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 19:23:09,501 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 19:23:09,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:09,501 INFO L85 PathProgramCache]: Analyzing trace with hash -759359402, now seen corresponding path program 1 times [2024-11-07 19:23:09,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:09,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174249822] [2024-11-07 19:23:09,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:09,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:09,792 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:09,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:09,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174249822] [2024-11-07 19:23:09,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174249822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:09,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:09,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:23:09,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965220342] [2024-11-07 19:23:09,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:09,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:23:09,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:09,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:23:09,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:23:10,182 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 134 [2024-11-07 19:23:10,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 111 transitions, 272 flow. Second operand has 5 states, 5 states have (on average 82.0) internal successors, (410), 5 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:10,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:10,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 134 [2024-11-07 19:23:10,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:10,374 INFO L124 PetriNetUnfolderBase]: 73/327 cut-off events. [2024-11-07 19:23:10,374 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-11-07 19:23:10,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 327 events. 73/327 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1319 event pairs, 63 based on Foata normal form. 0/263 useless extension candidates. Maximal degree in co-relation 544. Up to 158 conditions per place. [2024-11-07 19:23:10,376 INFO L140 encePairwiseOnDemand]: 116/134 looper letters, 43 selfloop transitions, 14 changer transitions 3/116 dead transitions. [2024-11-07 19:23:10,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 116 transitions, 402 flow [2024-11-07 19:23:10,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:23:10,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:23:10,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 459 transitions. [2024-11-07 19:23:10,380 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6850746268656717 [2024-11-07 19:23:10,380 INFO L175 Difference]: Start difference. First operand has 126 places, 111 transitions, 272 flow. Second operand 5 states and 459 transitions. [2024-11-07 19:23:10,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 116 transitions, 402 flow [2024-11-07 19:23:10,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 116 transitions, 401 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:23:10,384 INFO L231 Difference]: Finished difference. Result has 125 places, 107 transitions, 291 flow [2024-11-07 19:23:10,384 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=291, PETRI_PLACES=125, PETRI_TRANSITIONS=107} [2024-11-07 19:23:10,386 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -11 predicate places. [2024-11-07 19:23:10,386 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 107 transitions, 291 flow [2024-11-07 19:23:10,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.0) internal successors, (410), 5 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:10,387 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:10,388 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:23:10,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 19:23:10,388 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 19:23:10,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:10,388 INFO L85 PathProgramCache]: Analyzing trace with hash -2070751224, now seen corresponding path program 1 times [2024-11-07 19:23:10,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:10,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723205250] [2024-11-07 19:23:10,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:10,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:10,702 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:10,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:10,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723205250] [2024-11-07 19:23:10,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723205250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:10,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:10,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:23:10,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414547811] [2024-11-07 19:23:10,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:10,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 19:23:10,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:10,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 19:23:10,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:23:11,232 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 134 [2024-11-07 19:23:11,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 107 transitions, 291 flow. Second operand has 7 states, 7 states have (on average 65.42857142857143) internal successors, (458), 7 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:11,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:11,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 134 [2024-11-07 19:23:11,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:11,468 INFO L124 PetriNetUnfolderBase]: 64/292 cut-off events. [2024-11-07 19:23:11,468 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-11-07 19:23:11,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 292 events. 64/292 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1115 event pairs, 63 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 525. Up to 166 conditions per place. [2024-11-07 19:23:11,470 INFO L140 encePairwiseOnDemand]: 112/134 looper letters, 46 selfloop transitions, 17 changer transitions 0/102 dead transitions. [2024-11-07 19:23:11,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 102 transitions, 407 flow [2024-11-07 19:23:11,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 19:23:11,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 19:23:11,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 570 transitions. [2024-11-07 19:23:11,473 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5317164179104478 [2024-11-07 19:23:11,473 INFO L175 Difference]: Start difference. First operand has 125 places, 107 transitions, 291 flow. Second operand 8 states and 570 transitions. [2024-11-07 19:23:11,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 102 transitions, 407 flow [2024-11-07 19:23:11,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 102 transitions, 379 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 19:23:11,475 INFO L231 Difference]: Finished difference. Result has 123 places, 102 transitions, 287 flow [2024-11-07 19:23:11,476 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=287, PETRI_PLACES=123, PETRI_TRANSITIONS=102} [2024-11-07 19:23:11,476 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -13 predicate places. [2024-11-07 19:23:11,476 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 102 transitions, 287 flow [2024-11-07 19:23:11,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 65.42857142857143) internal successors, (458), 7 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:11,477 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:11,477 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:23:11,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 19:23:11,477 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 19:23:11,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:11,478 INFO L85 PathProgramCache]: Analyzing trace with hash -2070751223, now seen corresponding path program 1 times [2024-11-07 19:23:11,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:11,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931626124] [2024-11-07 19:23:11,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:11,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:11,959 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:11,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:11,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931626124] [2024-11-07 19:23:11,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931626124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:11,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:11,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:23:11,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830773033] [2024-11-07 19:23:11,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:11,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 19:23:11,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:11,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 19:23:11,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:23:12,608 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 134 [2024-11-07 19:23:12,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 102 transitions, 287 flow. Second operand has 7 states, 7 states have (on average 57.42857142857143) internal successors, (402), 7 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:12,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:12,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 134 [2024-11-07 19:23:12,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:12,841 INFO L124 PetriNetUnfolderBase]: 64/290 cut-off events. [2024-11-07 19:23:12,841 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-11-07 19:23:12,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 290 events. 64/290 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1130 event pairs, 63 based on Foata normal form. 1/245 useless extension candidates. Maximal degree in co-relation 517. Up to 172 conditions per place. [2024-11-07 19:23:12,842 INFO L140 encePairwiseOnDemand]: 119/134 looper letters, 49 selfloop transitions, 13 changer transitions 0/100 dead transitions. [2024-11-07 19:23:12,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 100 transitions, 407 flow [2024-11-07 19:23:12,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 19:23:12,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-07 19:23:12,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 446 transitions. [2024-11-07 19:23:12,845 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47547974413646055 [2024-11-07 19:23:12,845 INFO L175 Difference]: Start difference. First operand has 123 places, 102 transitions, 287 flow. Second operand 7 states and 446 transitions. [2024-11-07 19:23:12,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 100 transitions, 407 flow [2024-11-07 19:23:12,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 100 transitions, 373 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-07 19:23:12,847 INFO L231 Difference]: Finished difference. Result has 120 places, 100 transitions, 275 flow [2024-11-07 19:23:12,847 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=275, PETRI_PLACES=120, PETRI_TRANSITIONS=100} [2024-11-07 19:23:12,848 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -16 predicate places. [2024-11-07 19:23:12,848 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 100 transitions, 275 flow [2024-11-07 19:23:12,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 57.42857142857143) internal successors, (402), 7 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:12,849 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:12,849 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:23:12,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 19:23:12,849 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 19:23:12,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:12,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1422042280, now seen corresponding path program 1 times [2024-11-07 19:23:12,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:12,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213680805] [2024-11-07 19:23:12,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:12,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:13,089 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:13,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:13,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213680805] [2024-11-07 19:23:13,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213680805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:13,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:13,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:23:13,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147007354] [2024-11-07 19:23:13,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:13,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:23:13,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:13,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:23:13,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:23:13,363 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 134 [2024-11-07 19:23:13,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 100 transitions, 275 flow. Second operand has 5 states, 5 states have (on average 79.8) internal successors, (399), 5 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:13,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:13,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 134 [2024-11-07 19:23:13,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:13,524 INFO L124 PetriNetUnfolderBase]: 64/289 cut-off events. [2024-11-07 19:23:13,524 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2024-11-07 19:23:13,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 289 events. 64/289 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1117 event pairs, 63 based on Foata normal form. 1/241 useless extension candidates. Maximal degree in co-relation 503. Up to 171 conditions per place. [2024-11-07 19:23:13,526 INFO L140 encePairwiseOnDemand]: 120/134 looper letters, 40 selfloop transitions, 13 changer transitions 0/99 dead transitions. [2024-11-07 19:23:13,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 99 transitions, 379 flow [2024-11-07 19:23:13,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:23:13,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:23:13,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2024-11-07 19:23:13,527 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6477611940298508 [2024-11-07 19:23:13,527 INFO L175 Difference]: Start difference. First operand has 120 places, 100 transitions, 275 flow. Second operand 5 states and 434 transitions. [2024-11-07 19:23:13,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 99 transitions, 379 flow [2024-11-07 19:23:13,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 99 transitions, 353 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-07 19:23:13,530 INFO L231 Difference]: Finished difference. Result has 117 places, 99 transitions, 273 flow [2024-11-07 19:23:13,530 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=273, PETRI_PLACES=117, PETRI_TRANSITIONS=99} [2024-11-07 19:23:13,532 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -19 predicate places. [2024-11-07 19:23:13,532 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 99 transitions, 273 flow [2024-11-07 19:23:13,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.8) internal successors, (399), 5 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:13,533 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:13,533 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:23:13,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 19:23:13,533 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 19:23:13,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:13,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1422042281, now seen corresponding path program 1 times [2024-11-07 19:23:13,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:13,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295751452] [2024-11-07 19:23:13,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:13,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:13,645 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:13,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:13,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295751452] [2024-11-07 19:23:13,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295751452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:13,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:13,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:23:13,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334161332] [2024-11-07 19:23:13,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:13,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:23:13,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:13,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:23:13,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:23:13,882 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 134 [2024-11-07 19:23:13,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 99 transitions, 273 flow. Second operand has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:13,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:13,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 134 [2024-11-07 19:23:13,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:14,068 INFO L124 PetriNetUnfolderBase]: 64/288 cut-off events. [2024-11-07 19:23:14,069 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-11-07 19:23:14,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 288 events. 64/288 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1119 event pairs, 63 based on Foata normal form. 1/240 useless extension candidates. Maximal degree in co-relation 508. Up to 171 conditions per place. [2024-11-07 19:23:14,070 INFO L140 encePairwiseOnDemand]: 120/134 looper letters, 46 selfloop transitions, 13 changer transitions 0/98 dead transitions. [2024-11-07 19:23:14,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 98 transitions, 389 flow [2024-11-07 19:23:14,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:23:14,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:23:14,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 410 transitions. [2024-11-07 19:23:14,072 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6119402985074627 [2024-11-07 19:23:14,072 INFO L175 Difference]: Start difference. First operand has 117 places, 99 transitions, 273 flow. Second operand 5 states and 410 transitions. [2024-11-07 19:23:14,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 98 transitions, 389 flow [2024-11-07 19:23:14,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 98 transitions, 363 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 19:23:14,075 INFO L231 Difference]: Finished difference. Result has 116 places, 98 transitions, 271 flow [2024-11-07 19:23:14,075 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=271, PETRI_PLACES=116, PETRI_TRANSITIONS=98} [2024-11-07 19:23:14,075 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -20 predicate places. [2024-11-07 19:23:14,075 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 98 transitions, 271 flow [2024-11-07 19:23:14,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:14,076 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:14,076 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:23:14,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 19:23:14,076 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 19:23:14,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:14,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1496643655, now seen corresponding path program 1 times [2024-11-07 19:23:14,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:14,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111322816] [2024-11-07 19:23:14,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:14,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:14,482 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:14,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:14,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111322816] [2024-11-07 19:23:14,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111322816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:14,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:14,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:23:14,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335261423] [2024-11-07 19:23:14,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:14,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:23:14,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:14,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:23:14,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:23:14,884 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 134 [2024-11-07 19:23:14,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 98 transitions, 271 flow. Second operand has 6 states, 6 states have (on average 83.83333333333333) internal successors, (503), 6 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:14,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:14,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 134 [2024-11-07 19:23:14,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:15,019 INFO L124 PetriNetUnfolderBase]: 73/315 cut-off events. [2024-11-07 19:23:15,020 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2024-11-07 19:23:15,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 563 conditions, 315 events. 73/315 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1305 event pairs, 63 based on Foata normal form. 1/259 useless extension candidates. Maximal degree in co-relation 545. Up to 164 conditions per place. [2024-11-07 19:23:15,021 INFO L140 encePairwiseOnDemand]: 128/134 looper letters, 54 selfloop transitions, 3 changer transitions 3/104 dead transitions. [2024-11-07 19:23:15,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 104 transitions, 403 flow [2024-11-07 19:23:15,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:23:15,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:23:15,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 381 transitions. [2024-11-07 19:23:15,023 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.710820895522388 [2024-11-07 19:23:15,023 INFO L175 Difference]: Start difference. First operand has 116 places, 98 transitions, 271 flow. Second operand 4 states and 381 transitions. [2024-11-07 19:23:15,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 104 transitions, 403 flow [2024-11-07 19:23:15,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 104 transitions, 377 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 19:23:15,025 INFO L231 Difference]: Finished difference. Result has 112 places, 95 transitions, 245 flow [2024-11-07 19:23:15,026 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=245, PETRI_PLACES=112, PETRI_TRANSITIONS=95} [2024-11-07 19:23:15,026 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -24 predicate places. [2024-11-07 19:23:15,026 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 95 transitions, 245 flow [2024-11-07 19:23:15,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.83333333333333) internal successors, (503), 6 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:15,027 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:15,027 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:23:15,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 19:23:15,027 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 19:23:15,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:15,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1263746569, now seen corresponding path program 1 times [2024-11-07 19:23:15,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:15,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685857220] [2024-11-07 19:23:15,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:15,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:15,490 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:15,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:15,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685857220] [2024-11-07 19:23:15,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685857220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:15,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:15,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:23:15,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021176282] [2024-11-07 19:23:15,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:15,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 19:23:15,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:15,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 19:23:15,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:23:16,158 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 134 [2024-11-07 19:23:16,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 95 transitions, 245 flow. Second operand has 7 states, 7 states have (on average 58.57142857142857) internal successors, (410), 7 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:16,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:16,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 134 [2024-11-07 19:23:16,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:16,376 INFO L124 PetriNetUnfolderBase]: 64/281 cut-off events. [2024-11-07 19:23:16,377 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-11-07 19:23:16,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 281 events. 64/281 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1105 event pairs, 54 based on Foata normal form. 2/237 useless extension candidates. Maximal degree in co-relation 498. Up to 132 conditions per place. [2024-11-07 19:23:16,379 INFO L140 encePairwiseOnDemand]: 114/134 looper letters, 48 selfloop transitions, 16 changer transitions 3/100 dead transitions. [2024-11-07 19:23:16,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 100 transitions, 389 flow [2024-11-07 19:23:16,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 19:23:16,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-07 19:23:16,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 453 transitions. [2024-11-07 19:23:16,381 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48294243070362475 [2024-11-07 19:23:16,381 INFO L175 Difference]: Start difference. First operand has 112 places, 95 transitions, 245 flow. Second operand 7 states and 453 transitions. [2024-11-07 19:23:16,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 100 transitions, 389 flow [2024-11-07 19:23:16,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 100 transitions, 383 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 19:23:16,385 INFO L231 Difference]: Finished difference. Result has 111 places, 91 transitions, 263 flow [2024-11-07 19:23:16,386 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=263, PETRI_PLACES=111, PETRI_TRANSITIONS=91} [2024-11-07 19:23:16,387 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -25 predicate places. [2024-11-07 19:23:16,387 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 91 transitions, 263 flow [2024-11-07 19:23:16,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 58.57142857142857) internal successors, (410), 7 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:16,387 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:16,387 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:23:16,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 19:23:16,388 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 19:23:16,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:16,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1263746568, now seen corresponding path program 1 times [2024-11-07 19:23:16,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:16,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576599957] [2024-11-07 19:23:16,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:16,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:16,675 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:16,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:16,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576599957] [2024-11-07 19:23:16,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576599957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:16,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:16,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:23:16,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077655813] [2024-11-07 19:23:16,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:16,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 19:23:16,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:16,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 19:23:16,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:23:17,117 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 134 [2024-11-07 19:23:17,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 91 transitions, 263 flow. Second operand has 7 states, 7 states have (on average 66.71428571428571) internal successors, (467), 7 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:17,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:17,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 134 [2024-11-07 19:23:17,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:17,314 INFO L124 PetriNetUnfolderBase]: 64/279 cut-off events. [2024-11-07 19:23:17,315 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-11-07 19:23:17,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 279 events. 64/279 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1090 event pairs, 54 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 513. Up to 130 conditions per place. [2024-11-07 19:23:17,316 INFO L140 encePairwiseOnDemand]: 114/134 looper letters, 49 selfloop transitions, 18 changer transitions 3/98 dead transitions. [2024-11-07 19:23:17,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 98 transitions, 417 flow [2024-11-07 19:23:17,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 19:23:17,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 19:23:17,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 574 transitions. [2024-11-07 19:23:17,320 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5354477611940298 [2024-11-07 19:23:17,320 INFO L175 Difference]: Start difference. First operand has 111 places, 91 transitions, 263 flow. Second operand 8 states and 574 transitions. [2024-11-07 19:23:17,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 98 transitions, 417 flow [2024-11-07 19:23:17,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 98 transitions, 385 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-07 19:23:17,324 INFO L231 Difference]: Finished difference. Result has 110 places, 89 transitions, 263 flow [2024-11-07 19:23:17,324 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=263, PETRI_PLACES=110, PETRI_TRANSITIONS=89} [2024-11-07 19:23:17,325 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -26 predicate places. [2024-11-07 19:23:17,325 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 89 transitions, 263 flow [2024-11-07 19:23:17,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 66.71428571428571) internal successors, (467), 7 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:17,326 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:17,326 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:23:17,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 19:23:17,326 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 19:23:17,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:17,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1015266334, now seen corresponding path program 1 times [2024-11-07 19:23:17,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:17,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246557447] [2024-11-07 19:23:17,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:17,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:17,460 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:17,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:17,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246557447] [2024-11-07 19:23:17,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246557447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:17,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:17,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:23:17,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832662284] [2024-11-07 19:23:17,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:17,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:23:17,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:17,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:23:17,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:23:17,644 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 134 [2024-11-07 19:23:17,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 89 transitions, 263 flow. Second operand has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:17,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:17,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 134 [2024-11-07 19:23:17,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:17,781 INFO L124 PetriNetUnfolderBase]: 64/278 cut-off events. [2024-11-07 19:23:17,781 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-11-07 19:23:17,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 529 conditions, 278 events. 64/278 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1098 event pairs, 63 based on Foata normal form. 1/235 useless extension candidates. Maximal degree in co-relation 511. Up to 170 conditions per place. [2024-11-07 19:23:17,783 INFO L140 encePairwiseOnDemand]: 120/134 looper letters, 45 selfloop transitions, 13 changer transitions 0/88 dead transitions. [2024-11-07 19:23:17,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 88 transitions, 377 flow [2024-11-07 19:23:17,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:23:17,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:23:17,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 409 transitions. [2024-11-07 19:23:17,785 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6104477611940299 [2024-11-07 19:23:17,785 INFO L175 Difference]: Start difference. First operand has 110 places, 89 transitions, 263 flow. Second operand 5 states and 409 transitions. [2024-11-07 19:23:17,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 88 transitions, 377 flow [2024-11-07 19:23:17,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 88 transitions, 341 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-07 19:23:17,788 INFO L231 Difference]: Finished difference. Result has 106 places, 88 transitions, 251 flow [2024-11-07 19:23:17,788 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=251, PETRI_PLACES=106, PETRI_TRANSITIONS=88} [2024-11-07 19:23:17,788 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -30 predicate places. [2024-11-07 19:23:17,789 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 88 transitions, 251 flow [2024-11-07 19:23:17,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:17,789 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:17,789 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:23:17,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 19:23:17,789 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 19:23:17,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:17,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1015266333, now seen corresponding path program 1 times [2024-11-07 19:23:17,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:17,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139500667] [2024-11-07 19:23:17,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:17,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:18,054 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:18,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:18,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139500667] [2024-11-07 19:23:18,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139500667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:18,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:18,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:23:18,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888317521] [2024-11-07 19:23:18,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:18,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:23:18,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:18,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:23:18,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:23:18,322 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 134 [2024-11-07 19:23:18,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 88 transitions, 251 flow. Second operand has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:18,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:18,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 134 [2024-11-07 19:23:18,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:18,465 INFO L124 PetriNetUnfolderBase]: 64/277 cut-off events. [2024-11-07 19:23:18,465 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2024-11-07 19:23:18,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 277 events. 64/277 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1090 event pairs, 63 based on Foata normal form. 1/233 useless extension candidates. Maximal degree in co-relation 490. Up to 170 conditions per place. [2024-11-07 19:23:18,467 INFO L140 encePairwiseOnDemand]: 120/134 looper letters, 39 selfloop transitions, 13 changer transitions 0/87 dead transitions. [2024-11-07 19:23:18,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 87 transitions, 353 flow [2024-11-07 19:23:18,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:23:18,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:23:18,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 433 transitions. [2024-11-07 19:23:18,468 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6462686567164179 [2024-11-07 19:23:18,469 INFO L175 Difference]: Start difference. First operand has 106 places, 88 transitions, 251 flow. Second operand 5 states and 433 transitions. [2024-11-07 19:23:18,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 87 transitions, 353 flow [2024-11-07 19:23:18,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 87 transitions, 327 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 19:23:18,471 INFO L231 Difference]: Finished difference. Result has 105 places, 87 transitions, 249 flow [2024-11-07 19:23:18,471 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=105, PETRI_TRANSITIONS=87} [2024-11-07 19:23:18,471 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -31 predicate places. [2024-11-07 19:23:18,472 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 87 transitions, 249 flow [2024-11-07 19:23:18,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:18,472 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:18,472 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:23:18,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 19:23:18,472 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 19:23:18,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:18,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1670089695, now seen corresponding path program 1 times [2024-11-07 19:23:18,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:18,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630943388] [2024-11-07 19:23:18,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:18,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:20,120 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:20,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:20,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630943388] [2024-11-07 19:23:20,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630943388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:20,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:20,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 19:23:20,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478451494] [2024-11-07 19:23:20,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:20,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 19:23:20,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:20,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 19:23:20,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-07 19:23:22,676 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 134 [2024-11-07 19:23:22,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 87 transitions, 249 flow. Second operand has 15 states, 15 states have (on average 45.666666666666664) internal successors, (685), 15 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:22,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:22,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 134 [2024-11-07 19:23:22,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:23,241 INFO L124 PetriNetUnfolderBase]: 64/275 cut-off events. [2024-11-07 19:23:23,242 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-11-07 19:23:23,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 275 events. 64/275 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1088 event pairs, 54 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 497. Up to 134 conditions per place. [2024-11-07 19:23:23,243 INFO L140 encePairwiseOnDemand]: 115/134 looper letters, 50 selfloop transitions, 17 changer transitions 3/94 dead transitions. [2024-11-07 19:23:23,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 94 transitions, 403 flow [2024-11-07 19:23:23,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 19:23:23,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-07 19:23:23,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 634 transitions. [2024-11-07 19:23:23,247 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3639494833524684 [2024-11-07 19:23:23,247 INFO L175 Difference]: Start difference. First operand has 105 places, 87 transitions, 249 flow. Second operand 13 states and 634 transitions. [2024-11-07 19:23:23,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 94 transitions, 403 flow [2024-11-07 19:23:23,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 94 transitions, 377 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 19:23:23,250 INFO L231 Difference]: Finished difference. Result has 111 places, 85 transitions, 253 flow [2024-11-07 19:23:23,251 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=253, PETRI_PLACES=111, PETRI_TRANSITIONS=85} [2024-11-07 19:23:23,251 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -25 predicate places. [2024-11-07 19:23:23,252 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 85 transitions, 253 flow [2024-11-07 19:23:23,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 45.666666666666664) internal successors, (685), 15 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:23,252 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:23,252 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:23:23,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 19:23:23,252 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 19:23:23,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:23,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1670089694, now seen corresponding path program 1 times [2024-11-07 19:23:23,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:23,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707192566] [2024-11-07 19:23:23,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:23,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:23,883 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:23,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:23,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707192566] [2024-11-07 19:23:23,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707192566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:23,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:23,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 19:23:23,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238808736] [2024-11-07 19:23:23,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:23,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 19:23:23,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:23,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 19:23:23,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-07 19:23:24,552 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 134 [2024-11-07 19:23:24,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 85 transitions, 253 flow. Second operand has 9 states, 9 states have (on average 78.77777777777777) internal successors, (709), 9 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:24,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:24,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 134 [2024-11-07 19:23:24,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:24,740 INFO L124 PetriNetUnfolderBase]: 64/274 cut-off events. [2024-11-07 19:23:24,740 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-11-07 19:23:24,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 274 events. 64/274 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1087 event pairs, 54 based on Foata normal form. 1/231 useless extension candidates. Maximal degree in co-relation 508. Up to 135 conditions per place. [2024-11-07 19:23:24,742 INFO L140 encePairwiseOnDemand]: 121/134 looper letters, 54 selfloop transitions, 12 changer transitions 3/93 dead transitions. [2024-11-07 19:23:24,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 93 transitions, 407 flow [2024-11-07 19:23:24,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 19:23:24,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 19:23:24,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 668 transitions. [2024-11-07 19:23:24,744 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6231343283582089 [2024-11-07 19:23:24,744 INFO L175 Difference]: Start difference. First operand has 111 places, 85 transitions, 253 flow. Second operand 8 states and 668 transitions. [2024-11-07 19:23:24,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 93 transitions, 407 flow [2024-11-07 19:23:24,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 93 transitions, 373 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-11-07 19:23:24,747 INFO L231 Difference]: Finished difference. Result has 105 places, 84 transitions, 241 flow [2024-11-07 19:23:24,748 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=241, PETRI_PLACES=105, PETRI_TRANSITIONS=84} [2024-11-07 19:23:24,748 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -31 predicate places. [2024-11-07 19:23:24,748 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 84 transitions, 241 flow [2024-11-07 19:23:24,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 78.77777777777777) internal successors, (709), 9 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:24,749 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:24,749 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:23:24,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 19:23:24,749 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 19:23:24,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:24,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1361544926, now seen corresponding path program 1 times [2024-11-07 19:23:24,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:24,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772199492] [2024-11-07 19:23:24,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:24,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:24,891 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:24,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:24,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772199492] [2024-11-07 19:23:24,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772199492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:24,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:24,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:23:24,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061432125] [2024-11-07 19:23:24,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:24,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:23:24,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:24,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:23:24,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:23:25,177 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 134 [2024-11-07 19:23:25,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 84 transitions, 241 flow. Second operand has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:25,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:25,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 134 [2024-11-07 19:23:25,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:25,350 INFO L124 PetriNetUnfolderBase]: 73/290 cut-off events. [2024-11-07 19:23:25,350 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-11-07 19:23:25,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 552 conditions, 290 events. 73/290 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1174 event pairs, 45 based on Foata normal form. 2/246 useless extension candidates. Maximal degree in co-relation 534. Up to 108 conditions per place. [2024-11-07 19:23:25,352 INFO L140 encePairwiseOnDemand]: 114/134 looper letters, 48 selfloop transitions, 18 changer transitions 0/91 dead transitions. [2024-11-07 19:23:25,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 91 transitions, 387 flow [2024-11-07 19:23:25,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:23:25,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:23:25,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 484 transitions. [2024-11-07 19:23:25,353 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6019900497512438 [2024-11-07 19:23:25,353 INFO L175 Difference]: Start difference. First operand has 105 places, 84 transitions, 241 flow. Second operand 6 states and 484 transitions. [2024-11-07 19:23:25,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 91 transitions, 387 flow [2024-11-07 19:23:25,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 91 transitions, 363 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-07 19:23:25,356 INFO L231 Difference]: Finished difference. Result has 101 places, 82 transitions, 249 flow [2024-11-07 19:23:25,356 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=249, PETRI_PLACES=101, PETRI_TRANSITIONS=82} [2024-11-07 19:23:25,356 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -35 predicate places. [2024-11-07 19:23:25,356 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 82 transitions, 249 flow [2024-11-07 19:23:25,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:25,357 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:25,357 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:23:25,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 19:23:25,357 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 19:23:25,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:25,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1361544925, now seen corresponding path program 1 times [2024-11-07 19:23:25,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:25,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505747820] [2024-11-07 19:23:25,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:25,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:25,583 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:25,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:25,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505747820] [2024-11-07 19:23:25,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505747820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:25,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:25,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:23:25,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659432785] [2024-11-07 19:23:25,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:25,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:23:25,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:25,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:23:25,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:23:25,821 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 134 [2024-11-07 19:23:25,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 82 transitions, 249 flow. Second operand has 5 states, 5 states have (on average 80.8) internal successors, (404), 5 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:25,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:25,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 134 [2024-11-07 19:23:25,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:25,987 INFO L124 PetriNetUnfolderBase]: 73/272 cut-off events. [2024-11-07 19:23:25,987 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-11-07 19:23:25,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 552 conditions, 272 events. 73/272 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1062 event pairs, 18 based on Foata normal form. 2/249 useless extension candidates. Maximal degree in co-relation 534. Up to 135 conditions per place. [2024-11-07 19:23:25,989 INFO L140 encePairwiseOnDemand]: 116/134 looper letters, 44 selfloop transitions, 16 changer transitions 0/89 dead transitions. [2024-11-07 19:23:25,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 89 transitions, 383 flow [2024-11-07 19:23:25,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:23:25,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:23:25,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 514 transitions. [2024-11-07 19:23:25,990 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6393034825870647 [2024-11-07 19:23:25,990 INFO L175 Difference]: Start difference. First operand has 101 places, 82 transitions, 249 flow. Second operand 6 states and 514 transitions. [2024-11-07 19:23:25,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 89 transitions, 383 flow [2024-11-07 19:23:25,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 89 transitions, 347 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 19:23:25,993 INFO L231 Difference]: Finished difference. Result has 99 places, 80 transitions, 241 flow [2024-11-07 19:23:25,993 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=241, PETRI_PLACES=99, PETRI_TRANSITIONS=80} [2024-11-07 19:23:25,993 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -37 predicate places. [2024-11-07 19:23:25,993 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 80 transitions, 241 flow [2024-11-07 19:23:25,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.8) internal successors, (404), 5 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:25,994 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:25,994 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:23:25,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 19:23:25,994 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 19:23:25,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:25,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1442040983, now seen corresponding path program 1 times [2024-11-07 19:23:25,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:25,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793142507] [2024-11-07 19:23:25,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:25,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:26,164 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:26,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:26,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793142507] [2024-11-07 19:23:26,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793142507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:26,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:26,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:23:26,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213451796] [2024-11-07 19:23:26,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:26,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:23:26,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:26,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:23:26,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:23:26,263 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 134 [2024-11-07 19:23:26,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 80 transitions, 241 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:26,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:26,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 134 [2024-11-07 19:23:26,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:26,368 INFO L124 PetriNetUnfolderBase]: 64/273 cut-off events. [2024-11-07 19:23:26,369 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-11-07 19:23:26,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 273 events. 64/273 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1101 event pairs, 56 based on Foata normal form. 8/244 useless extension candidates. Maximal degree in co-relation 496. Up to 162 conditions per place. [2024-11-07 19:23:26,370 INFO L140 encePairwiseOnDemand]: 130/134 looper letters, 55 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2024-11-07 19:23:26,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 85 transitions, 367 flow [2024-11-07 19:23:26,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:23:26,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:23:26,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2024-11-07 19:23:26,372 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8084577114427861 [2024-11-07 19:23:26,372 INFO L175 Difference]: Start difference. First operand has 99 places, 80 transitions, 241 flow. Second operand 3 states and 325 transitions. [2024-11-07 19:23:26,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 85 transitions, 367 flow [2024-11-07 19:23:26,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 85 transitions, 333 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 19:23:26,374 INFO L231 Difference]: Finished difference. Result has 94 places, 78 transitions, 209 flow [2024-11-07 19:23:26,374 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=209, PETRI_PLACES=94, PETRI_TRANSITIONS=78} [2024-11-07 19:23:26,374 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -42 predicate places. [2024-11-07 19:23:26,374 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 78 transitions, 209 flow [2024-11-07 19:23:26,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:26,375 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:26,375 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:23:26,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 19:23:26,375 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 19:23:26,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:26,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1442040984, now seen corresponding path program 1 times [2024-11-07 19:23:26,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:26,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844024470] [2024-11-07 19:23:26,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:26,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:26,493 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:26,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:26,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844024470] [2024-11-07 19:23:26,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844024470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:26,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:26,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:23:26,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119891896] [2024-11-07 19:23:26,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:26,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:23:26,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:26,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:23:26,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:23:26,558 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 134 [2024-11-07 19:23:26,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 78 transitions, 209 flow. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:26,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:26,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 134 [2024-11-07 19:23:26,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:26,632 INFO L124 PetriNetUnfolderBase]: 71/264 cut-off events. [2024-11-07 19:23:26,633 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2024-11-07 19:23:26,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 264 events. 71/264 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 982 event pairs, 56 based on Foata normal form. 8/243 useless extension candidates. Maximal degree in co-relation 493. Up to 162 conditions per place. [2024-11-07 19:23:26,635 INFO L140 encePairwiseOnDemand]: 130/134 looper letters, 56 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2024-11-07 19:23:26,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 83 transitions, 335 flow [2024-11-07 19:23:26,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:23:26,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:23:26,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2024-11-07 19:23:26,636 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8034825870646766 [2024-11-07 19:23:26,637 INFO L175 Difference]: Start difference. First operand has 94 places, 78 transitions, 209 flow. Second operand 3 states and 323 transitions. [2024-11-07 19:23:26,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 83 transitions, 335 flow [2024-11-07 19:23:26,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 83 transitions, 331 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:23:26,639 INFO L231 Difference]: Finished difference. Result has 92 places, 76 transitions, 205 flow [2024-11-07 19:23:26,639 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=205, PETRI_PLACES=92, PETRI_TRANSITIONS=76} [2024-11-07 19:23:26,641 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -44 predicate places. [2024-11-07 19:23:26,641 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 76 transitions, 205 flow [2024-11-07 19:23:26,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:26,641 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:26,641 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:23:26,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 19:23:26,642 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 19:23:26,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:26,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1876744202, now seen corresponding path program 1 times [2024-11-07 19:23:26,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:26,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971832090] [2024-11-07 19:23:26,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:26,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:27,118 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:27,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:27,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971832090] [2024-11-07 19:23:27,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971832090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:27,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:27,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 19:23:27,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464500508] [2024-11-07 19:23:27,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:27,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 19:23:27,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:27,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 19:23:27,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-07 19:23:27,689 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 134 [2024-11-07 19:23:27,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 76 transitions, 205 flow. Second operand has 8 states, 8 states have (on average 76.0) internal successors, (608), 8 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:27,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:27,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 134 [2024-11-07 19:23:27,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:27,907 INFO L124 PetriNetUnfolderBase]: 85/312 cut-off events. [2024-11-07 19:23:27,907 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-11-07 19:23:27,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 312 events. 85/312 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1288 event pairs, 60 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 579. Up to 157 conditions per place. [2024-11-07 19:23:27,909 INFO L140 encePairwiseOnDemand]: 118/134 looper letters, 57 selfloop transitions, 15 changer transitions 3/95 dead transitions. [2024-11-07 19:23:27,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 95 transitions, 401 flow [2024-11-07 19:23:27,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 19:23:27,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 19:23:27,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 642 transitions. [2024-11-07 19:23:27,910 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5988805970149254 [2024-11-07 19:23:27,910 INFO L175 Difference]: Start difference. First operand has 92 places, 76 transitions, 205 flow. Second operand 8 states and 642 transitions. [2024-11-07 19:23:27,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 95 transitions, 401 flow [2024-11-07 19:23:27,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 95 transitions, 389 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:23:27,913 INFO L231 Difference]: Finished difference. Result has 98 places, 78 transitions, 244 flow [2024-11-07 19:23:27,913 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=244, PETRI_PLACES=98, PETRI_TRANSITIONS=78} [2024-11-07 19:23:27,915 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -38 predicate places. [2024-11-07 19:23:27,915 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 78 transitions, 244 flow [2024-11-07 19:23:27,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 76.0) internal successors, (608), 8 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:27,916 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:27,916 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:23:27,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 19:23:27,916 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 19:23:27,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:27,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1876744203, now seen corresponding path program 1 times [2024-11-07 19:23:27,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:27,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394565405] [2024-11-07 19:23:27,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:27,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:28,182 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:28,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:28,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394565405] [2024-11-07 19:23:28,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394565405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:28,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:28,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:23:28,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620630533] [2024-11-07 19:23:28,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:28,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:23:28,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:28,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:23:28,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:23:28,439 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 134 [2024-11-07 19:23:28,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 78 transitions, 244 flow. Second operand has 6 states, 6 states have (on average 85.33333333333333) internal successors, (512), 6 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:28,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:28,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 134 [2024-11-07 19:23:28,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:28,574 INFO L124 PetriNetUnfolderBase]: 79/290 cut-off events. [2024-11-07 19:23:28,574 INFO L125 PetriNetUnfolderBase]: For 86/92 co-relation queries the response was YES. [2024-11-07 19:23:28,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 612 conditions, 290 events. 79/290 cut-off events. For 86/92 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1142 event pairs, 54 based on Foata normal form. 17/276 useless extension candidates. Maximal degree in co-relation 593. Up to 139 conditions per place. [2024-11-07 19:23:28,576 INFO L140 encePairwiseOnDemand]: 123/134 looper letters, 60 selfloop transitions, 11 changer transitions 3/94 dead transitions. [2024-11-07 19:23:28,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 94 transitions, 426 flow [2024-11-07 19:23:28,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:23:28,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:23:28,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 544 transitions. [2024-11-07 19:23:28,577 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6766169154228856 [2024-11-07 19:23:28,577 INFO L175 Difference]: Start difference. First operand has 98 places, 78 transitions, 244 flow. Second operand 6 states and 544 transitions. [2024-11-07 19:23:28,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 94 transitions, 426 flow [2024-11-07 19:23:28,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 94 transitions, 399 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-07 19:23:28,579 INFO L231 Difference]: Finished difference. Result has 96 places, 77 transitions, 237 flow [2024-11-07 19:23:28,579 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=96, PETRI_TRANSITIONS=77} [2024-11-07 19:23:28,580 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -40 predicate places. [2024-11-07 19:23:28,580 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 77 transitions, 237 flow [2024-11-07 19:23:28,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.33333333333333) internal successors, (512), 6 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:28,581 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:28,581 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:23:28,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 19:23:28,581 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 19:23:28,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:28,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1950472676, now seen corresponding path program 1 times [2024-11-07 19:23:28,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:28,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805927481] [2024-11-07 19:23:28,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:28,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:31,637 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:31,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:31,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805927481] [2024-11-07 19:23:31,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805927481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:31,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:31,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2024-11-07 19:23:31,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953205161] [2024-11-07 19:23:31,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:31,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-07 19:23:31,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:31,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-07 19:23:31,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2024-11-07 19:23:37,469 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 134 [2024-11-07 19:23:37,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 77 transitions, 237 flow. Second operand has 28 states, 28 states have (on average 57.392857142857146) internal successors, (1607), 28 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:37,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:37,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 134 [2024-11-07 19:23:37,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:38,883 INFO L124 PetriNetUnfolderBase]: 111/368 cut-off events. [2024-11-07 19:23:38,883 INFO L125 PetriNetUnfolderBase]: For 148/155 co-relation queries the response was YES. [2024-11-07 19:23:38,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 790 conditions, 368 events. 111/368 cut-off events. For 148/155 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1614 event pairs, 6 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 771. Up to 65 conditions per place. [2024-11-07 19:23:38,885 INFO L140 encePairwiseOnDemand]: 104/134 looper letters, 70 selfloop transitions, 35 changer transitions 3/119 dead transitions. [2024-11-07 19:23:38,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 119 transitions, 555 flow [2024-11-07 19:23:38,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-07 19:23:38,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2024-11-07 19:23:38,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1666 transitions. [2024-11-07 19:23:38,887 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44402985074626866 [2024-11-07 19:23:38,887 INFO L175 Difference]: Start difference. First operand has 96 places, 77 transitions, 237 flow. Second operand 28 states and 1666 transitions. [2024-11-07 19:23:38,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 119 transitions, 555 flow [2024-11-07 19:23:38,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 119 transitions, 525 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 19:23:38,891 INFO L231 Difference]: Finished difference. Result has 122 places, 85 transitions, 332 flow [2024-11-07 19:23:38,891 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=332, PETRI_PLACES=122, PETRI_TRANSITIONS=85} [2024-11-07 19:23:38,891 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -14 predicate places. [2024-11-07 19:23:38,891 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 85 transitions, 332 flow [2024-11-07 19:23:38,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 57.392857142857146) internal successors, (1607), 28 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:38,892 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:38,892 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:23:38,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 19:23:38,892 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 19:23:38,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:38,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1950472677, now seen corresponding path program 1 times [2024-11-07 19:23:38,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:38,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002841034] [2024-11-07 19:23:38,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:38,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:38,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:42,224 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:42,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:42,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002841034] [2024-11-07 19:23:42,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002841034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:42,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:42,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2024-11-07 19:23:42,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711314232] [2024-11-07 19:23:42,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:42,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-07 19:23:42,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:42,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-07 19:23:42,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2024-11-07 19:23:48,567 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 134 [2024-11-07 19:23:48,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 85 transitions, 332 flow. Second operand has 28 states, 28 states have (on average 40.392857142857146) internal successors, (1131), 28 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:48,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:48,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 134 [2024-11-07 19:23:48,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:49,990 INFO L124 PetriNetUnfolderBase]: 139/424 cut-off events. [2024-11-07 19:23:49,990 INFO L125 PetriNetUnfolderBase]: For 240/247 co-relation queries the response was YES. [2024-11-07 19:23:49,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 424 events. 139/424 cut-off events. For 240/247 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1915 event pairs, 6 based on Foata normal form. 12/408 useless extension candidates. Maximal degree in co-relation 997. Up to 98 conditions per place. [2024-11-07 19:23:49,993 INFO L140 encePairwiseOnDemand]: 106/134 looper letters, 75 selfloop transitions, 34 changer transitions 3/122 dead transitions. [2024-11-07 19:23:49,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 122 transitions, 639 flow [2024-11-07 19:23:49,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-07 19:23:49,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2024-11-07 19:23:49,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1272 transitions. [2024-11-07 19:23:49,995 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3164179104477612 [2024-11-07 19:23:49,996 INFO L175 Difference]: Start difference. First operand has 122 places, 85 transitions, 332 flow. Second operand 30 states and 1272 transitions. [2024-11-07 19:23:49,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 122 transitions, 639 flow [2024-11-07 19:23:49,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 122 transitions, 598 flow, removed 0 selfloop flow, removed 20 redundant places. [2024-11-07 19:23:49,999 INFO L231 Difference]: Finished difference. Result has 133 places, 86 transitions, 374 flow [2024-11-07 19:23:49,999 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=374, PETRI_PLACES=133, PETRI_TRANSITIONS=86} [2024-11-07 19:23:50,000 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -3 predicate places. [2024-11-07 19:23:50,000 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 86 transitions, 374 flow [2024-11-07 19:23:50,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 40.392857142857146) internal successors, (1131), 28 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:50,001 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:50,001 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:23:50,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 19:23:50,001 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 19:23:50,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:50,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1473077129, now seen corresponding path program 1 times [2024-11-07 19:23:50,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:50,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110113007] [2024-11-07 19:23:50,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:50,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:50,778 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:50,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:50,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110113007] [2024-11-07 19:23:50,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110113007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:50,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:50,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 19:23:50,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835236166] [2024-11-07 19:23:50,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:50,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 19:23:50,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:50,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 19:23:50,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-07 19:23:51,693 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 134 [2024-11-07 19:23:51,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 86 transitions, 374 flow. Second operand has 12 states, 12 states have (on average 62.75) internal successors, (753), 12 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:51,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:51,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 134 [2024-11-07 19:23:51,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:51,869 INFO L124 PetriNetUnfolderBase]: 107/365 cut-off events. [2024-11-07 19:23:51,870 INFO L125 PetriNetUnfolderBase]: For 420/428 co-relation queries the response was YES. [2024-11-07 19:23:51,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 365 events. 107/365 cut-off events. For 420/428 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1680 event pairs, 30 based on Foata normal form. 0/329 useless extension candidates. Maximal degree in co-relation 917. Up to 222 conditions per place. [2024-11-07 19:23:51,872 INFO L140 encePairwiseOnDemand]: 114/134 looper letters, 52 selfloop transitions, 19 changer transitions 0/93 dead transitions. [2024-11-07 19:23:51,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 93 transitions, 553 flow [2024-11-07 19:23:51,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:23:51,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:23:51,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 414 transitions. [2024-11-07 19:23:51,873 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5149253731343284 [2024-11-07 19:23:51,874 INFO L175 Difference]: Start difference. First operand has 133 places, 86 transitions, 374 flow. Second operand 6 states and 414 transitions. [2024-11-07 19:23:51,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 93 transitions, 553 flow [2024-11-07 19:23:51,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 93 transitions, 482 flow, removed 0 selfloop flow, removed 27 redundant places. [2024-11-07 19:23:51,877 INFO L231 Difference]: Finished difference. Result has 110 places, 85 transitions, 345 flow [2024-11-07 19:23:51,878 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=345, PETRI_PLACES=110, PETRI_TRANSITIONS=85} [2024-11-07 19:23:51,878 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -26 predicate places. [2024-11-07 19:23:51,878 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 85 transitions, 345 flow [2024-11-07 19:23:51,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 62.75) internal successors, (753), 12 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:51,879 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:51,879 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:23:51,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-07 19:23:51,879 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-07 19:23:51,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:51,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1579248374, now seen corresponding path program 1 times [2024-11-07 19:23:51,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:51,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829638772] [2024-11-07 19:23:51,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:51,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:23:52,356 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:23:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:23:52,800 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 19:23:52,800 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:23:52,801 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 92 remaining) [2024-11-07 19:23:52,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 92 remaining) [2024-11-07 19:23:52,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 92 remaining) [2024-11-07 19:23:52,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 92 remaining) [2024-11-07 19:23:52,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 92 remaining) [2024-11-07 19:23:52,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 92 remaining) [2024-11-07 19:23:52,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 92 remaining) [2024-11-07 19:23:52,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 92 remaining) [2024-11-07 19:23:52,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 92 remaining) [2024-11-07 19:23:52,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 92 remaining) [2024-11-07 19:23:52,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 92 remaining) [2024-11-07 19:23:52,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 92 remaining) [2024-11-07 19:23:52,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 92 remaining) [2024-11-07 19:23:52,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 92 remaining) [2024-11-07 19:23:52,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 92 remaining) [2024-11-07 19:23:52,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 92 remaining) [2024-11-07 19:23:52,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 92 remaining) [2024-11-07 19:23:52,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 92 remaining) [2024-11-07 19:23:52,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 92 remaining) [2024-11-07 19:23:52,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 92 remaining) [2024-11-07 19:23:52,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 92 remaining) [2024-11-07 19:23:52,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 92 remaining) [2024-11-07 19:23:52,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 92 remaining) [2024-11-07 19:23:52,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 92 remaining) [2024-11-07 19:23:52,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 92 remaining) [2024-11-07 19:23:52,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 92 remaining) [2024-11-07 19:23:52,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 92 remaining) [2024-11-07 19:23:52,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 92 remaining) [2024-11-07 19:23:52,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 92 remaining) [2024-11-07 19:23:52,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 92 remaining) [2024-11-07 19:23:52,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 92 remaining) [2024-11-07 19:23:52,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 92 remaining) [2024-11-07 19:23:52,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 92 remaining) [2024-11-07 19:23:52,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 92 remaining) [2024-11-07 19:23:52,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 92 remaining) [2024-11-07 19:23:52,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 92 remaining) [2024-11-07 19:23:52,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 92 remaining) [2024-11-07 19:23:52,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 92 remaining) [2024-11-07 19:23:52,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 92 remaining) [2024-11-07 19:23:52,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 92 remaining) [2024-11-07 19:23:52,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 92 remaining) [2024-11-07 19:23:52,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 92 remaining) [2024-11-07 19:23:52,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 92 remaining) [2024-11-07 19:23:52,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 92 remaining) [2024-11-07 19:23:52,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 92 remaining) [2024-11-07 19:23:52,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 92 remaining) [2024-11-07 19:23:52,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 92 remaining) [2024-11-07 19:23:52,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 92 remaining) [2024-11-07 19:23:52,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 92 remaining) [2024-11-07 19:23:52,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 92 remaining) [2024-11-07 19:23:52,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 92 remaining) [2024-11-07 19:23:52,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 92 remaining) [2024-11-07 19:23:52,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 92 remaining) [2024-11-07 19:23:52,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 92 remaining) [2024-11-07 19:23:52,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 92 remaining) [2024-11-07 19:23:52,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 92 remaining) [2024-11-07 19:23:52,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 92 remaining) [2024-11-07 19:23:52,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 92 remaining) [2024-11-07 19:23:52,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 92 remaining) [2024-11-07 19:23:52,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 92 remaining) [2024-11-07 19:23:52,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 92 remaining) [2024-11-07 19:23:52,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 92 remaining) [2024-11-07 19:23:52,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 92 remaining) [2024-11-07 19:23:52,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 92 remaining) [2024-11-07 19:23:52,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 92 remaining) [2024-11-07 19:23:52,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 92 remaining) [2024-11-07 19:23:52,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 92 remaining) [2024-11-07 19:23:52,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK (24 of 92 remaining) [2024-11-07 19:23:52,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 92 remaining) [2024-11-07 19:23:52,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 92 remaining) [2024-11-07 19:23:52,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 92 remaining) [2024-11-07 19:23:52,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 92 remaining) [2024-11-07 19:23:52,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 92 remaining) [2024-11-07 19:23:52,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 92 remaining) [2024-11-07 19:23:52,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 92 remaining) [2024-11-07 19:23:52,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 92 remaining) [2024-11-07 19:23:52,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 92 remaining) [2024-11-07 19:23:52,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 92 remaining) [2024-11-07 19:23:52,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 92 remaining) [2024-11-07 19:23:52,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 92 remaining) [2024-11-07 19:23:52,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 92 remaining) [2024-11-07 19:23:52,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 92 remaining) [2024-11-07 19:23:52,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 92 remaining) [2024-11-07 19:23:52,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 92 remaining) [2024-11-07 19:23:52,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 92 remaining) [2024-11-07 19:23:52,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 92 remaining) [2024-11-07 19:23:52,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 92 remaining) [2024-11-07 19:23:52,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 92 remaining) [2024-11-07 19:23:52,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 92 remaining) [2024-11-07 19:23:52,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 92 remaining) [2024-11-07 19:23:52,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 92 remaining) [2024-11-07 19:23:52,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 92 remaining) [2024-11-07 19:23:52,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-07 19:23:52,812 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:23:52,919 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 19:23:52,919 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 19:23:52,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:23:52 BasicIcfg [2024-11-07 19:23:52,931 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 19:23:52,932 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 19:23:52,932 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 19:23:52,932 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 19:23:52,935 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:23:05" (3/4) ... [2024-11-07 19:23:52,935 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-07 19:23:53,034 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 19:23:53,034 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 19:23:53,035 INFO L158 Benchmark]: Toolchain (without parser) took 49758.14ms. Allocated memory was 117.4MB in the beginning and 771.8MB in the end (delta: 654.3MB). Free memory was 89.8MB in the beginning and 712.3MB in the end (delta: -622.5MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. [2024-11-07 19:23:53,035 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:23:53,035 INFO L158 Benchmark]: CACSL2BoogieTranslator took 645.03ms. Allocated memory is still 117.4MB. Free memory was 89.6MB in the beginning and 49.3MB in the end (delta: 40.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-07 19:23:53,035 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.63ms. Allocated memory is still 117.4MB. Free memory was 49.3MB in the beginning and 45.8MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:23:53,035 INFO L158 Benchmark]: Boogie Preprocessor took 100.92ms. Allocated memory is still 117.4MB. Free memory was 45.8MB in the beginning and 87.2MB in the end (delta: -41.4MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-11-07 19:23:53,036 INFO L158 Benchmark]: RCFGBuilder took 1367.45ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 87.2MB in the beginning and 69.6MB in the end (delta: 17.6MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. [2024-11-07 19:23:53,080 INFO L158 Benchmark]: TraceAbstraction took 47484.20ms. Allocated memory was 151.0MB in the beginning and 771.8MB in the end (delta: 620.8MB). Free memory was 68.9MB in the beginning and 720.7MB in the end (delta: -651.8MB). Peak memory consumption was 425.8MB. Max. memory is 16.1GB. [2024-11-07 19:23:53,081 INFO L158 Benchmark]: Witness Printer took 102.43ms. Allocated memory is still 771.8MB. Free memory was 720.7MB in the beginning and 712.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 19:23:53,082 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.48ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 645.03ms. Allocated memory is still 117.4MB. Free memory was 89.6MB in the beginning and 49.3MB in the end (delta: 40.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.63ms. Allocated memory is still 117.4MB. Free memory was 49.3MB in the beginning and 45.8MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 100.92ms. Allocated memory is still 117.4MB. Free memory was 45.8MB in the beginning and 87.2MB in the end (delta: -41.4MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * RCFGBuilder took 1367.45ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 87.2MB in the beginning and 69.6MB in the end (delta: 17.6MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. * TraceAbstraction took 47484.20ms. Allocated memory was 151.0MB in the beginning and 771.8MB in the end (delta: 620.8MB). Free memory was 68.9MB in the beginning and 720.7MB in the end (delta: -651.8MB). Peak memory consumption was 425.8MB. Max. memory is 16.1GB. * Witness Printer took 102.43ms. Allocated memory is still 771.8MB. Free memory was 720.7MB in the beginning and 712.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * 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[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1254] 0 int i = 0; VAL [i=0, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=1, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=2, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=3, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=4, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=5, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=6, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=7, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=8, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=9, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=10, mutex={1:0}, slot={2:0}] [L1254] COND FALSE 0 !(i < 10) [L1256] 0 int j = __VERIFIER_nondet_int(), k = __VERIFIER_nondet_int(); [L1256] 0 int j = __VERIFIER_nondet_int(), k = __VERIFIER_nondet_int(); [L1257] CALL 0 assume_abort_if_not(0 <= j && j < 10) [L11] COND FALSE 0 !(!cond) [L1257] RET 0 assume_abort_if_not(0 <= j && j < 10) [L1258] CALL 0 assume_abort_if_not(0 <= k && k < 10) [L11] COND FALSE 0 !(!cond) [L1258] RET 0 assume_abort_if_not(0 <= k && k < 10) [L1259] 0 struct s *p; [L1260] 0 pthread_t t1; [L1261] 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; [L1261] RET, EXPR 0 new(1) [L1261] 0 slot[j] = new(1) [L1262] 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; [L1262] RET, EXPR 0 new(2) [L1262] EXPR 0 slot[j] [L1262] 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 [L1262] RET 0 list_add(new(2), slot[j]) [L1263] 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; [L1263] RET, EXPR 0 new(1) [L1263] 0 slot[k] = new(1) [L1264] 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; [L1264] RET, EXPR 0 new(2) [L1264] EXPR 0 slot[k] [L1264] CALL 0 list_add(new(2), slot[k]) [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 [L1264] RET 0 list_add(new(2), slot[k]) [L1265] CALL, EXPR 0 new(3) [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; [L1265] RET, EXPR 0 new(3) [L1265] 0 p = new(3) [L1266] EXPR 0 slot[j] [L1266] CALL 0 list_add(p, 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 [L1266] RET 0 list_add(p, slot[j]) [L1267] CALL, EXPR 0 new(3) [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; [L1267] RET, EXPR 0 new(3) [L1267] 0 p = new(3) [L1268] EXPR 0 slot[k] [L1268] CALL 0 list_add(p, slot[k]) [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 [L1268] RET 0 list_add(p, slot[k]) [L1269] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [j=2, k=5, mutex={1:0}, p={5:0}, slot={2:0}, t1=-1] [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 [\old(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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1253]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1269]: 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, 159 locations, 92 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: 47.2s, OverallIterations: 28, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 30.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13393 SdHoareTripleChecker+Valid, 26.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10416 mSDsluCounter, 8553 SdHoareTripleChecker+Invalid, 22.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8128 mSDsCounter, 835 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49756 IncrementalHoareTripleChecker+Invalid, 50591 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 835 mSolverCounterUnsat, 425 mSDtfsCounter, 49756 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 294 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=374occurred in iteration=26, InterpolantAutomatonStates: 206, 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, 1.2s SatisfiabilityAnalysisTime, 13.8s InterpolantComputationTime, 822 NumberOfCodeBlocks, 822 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 752 ConstructedInterpolants, 0 QuantifiedInterpolants, 8483 SizeOfPredicates, 0 NumberOfNonLiveVariables, 411 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 31 InterpolantComputations, 25 PerfectInterpolantSequences, 1275/1308 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! [2024-11-07 19:23:53,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)