./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.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/pthread-deagle/circular_buffer_bad.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', 'a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc'] 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/pthread-deagle/circular_buffer_bad.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 a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:40:26,143 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:40:26,224 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:40:26,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:40:26,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:40:26,258 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:40:26,259 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:40:26,259 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:40:26,259 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:40:26,259 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:40:26,259 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:40:26,259 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:40:26,260 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:40:26,260 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:40:26,260 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:40:26,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:40:26,262 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:40:26,262 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:40:26,263 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:40:26,263 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:40:26,264 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 19:40:26,264 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 19:40:26,264 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 19:40:26,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:40:26,264 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:40:26,265 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:40:26,265 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:40:26,265 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:40:26,265 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:40:26,265 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:40:26,266 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:40:26,266 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:40:26,266 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:40:26,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:40:26,266 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:40:26,266 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:40:26,267 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 19:40:26,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 19:40:26,267 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:40:26,267 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:40:26,267 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:40:26,267 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:40:26,267 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 -> a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc [2024-11-07 19:40:26,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:40:26,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:40:26,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:40:26,539 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:40:26,540 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:40:26,542 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2024-11-07 19:40:27,842 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:40:28,154 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:40:28,157 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2024-11-07 19:40:28,174 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30083b0ee/bc26292189eb40399656b58245eea881/FLAGa2bb7d4db [2024-11-07 19:40:28,197 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30083b0ee/bc26292189eb40399656b58245eea881 [2024-11-07 19:40:28,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:40:28,201 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:40:28,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:40:28,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:40:28,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:40:28,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:40:28" (1/1) ... [2024-11-07 19:40:28,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cbd77b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:40:28, skipping insertion in model container [2024-11-07 19:40:28,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:40:28" (1/1) ... [2024-11-07 19:40:28,246 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:40:28,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:40:28,618 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:40:28,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:40:28,723 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:40:28,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:40:28 WrapperNode [2024-11-07 19:40:28,724 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:40:28,725 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:40:28,725 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:40:28,725 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:40:28,731 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:40:28" (1/1) ... [2024-11-07 19:40:28,749 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:40:28" (1/1) ... [2024-11-07 19:40:28,784 INFO L138 Inliner]: procedures = 168, calls = 40, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 142 [2024-11-07 19:40:28,787 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:40:28,787 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:40:28,787 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:40:28,788 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:40:28,796 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:40:28" (1/1) ... [2024-11-07 19:40:28,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:40:28" (1/1) ... [2024-11-07 19:40:28,801 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:40:28" (1/1) ... [2024-11-07 19:40:28,825 INFO L175 MemorySlicer]: Split 23 memory accesses to 4 slices as follows [2, 1, 12, 8]. 52 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 1, 10, 8]. The 1 writes are split as follows [0, 0, 1, 0]. [2024-11-07 19:40:28,825 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:40:28" (1/1) ... [2024-11-07 19:40:28,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:40:28" (1/1) ... [2024-11-07 19:40:28,835 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:40:28" (1/1) ... [2024-11-07 19:40:28,844 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:40:28" (1/1) ... [2024-11-07 19:40:28,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:40:28" (1/1) ... [2024-11-07 19:40:28,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:40:28" (1/1) ... [2024-11-07 19:40:28,854 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:40:28,862 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:40:28,862 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:40:28,862 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:40:28,863 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:40:28" (1/1) ... [2024-11-07 19:40:28,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:40:28,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:40:28,896 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:40:28,899 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:40:28,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 19:40:28,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 19:40:28,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 19:40:28,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-07 19:40:28,921 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-07 19:40:28,921 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-07 19:40:28,921 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-07 19:40:28,922 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-07 19:40:28,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 19:40:28,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 19:40:28,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 19:40:28,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-07 19:40:28,922 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-07 19:40:28,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:40:28,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-07 19:40:28,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-07 19:40:28,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-07 19:40:28,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-07 19:40:28,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 19:40:28,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 19:40:28,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 19:40:28,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-07 19:40:28,923 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-07 19:40:28,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:40:28,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:40:28,925 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:40:29,056 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:40:29,058 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:40:29,345 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 19:40:29,345 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:40:29,589 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:40:29,591 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 19:40:29,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:40:29 BoogieIcfgContainer [2024-11-07 19:40:29,592 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:40:29,594 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:40:29,594 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:40:29,598 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:40:29,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:40:28" (1/3) ... [2024-11-07 19:40:29,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f711d9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:40:29, skipping insertion in model container [2024-11-07 19:40:29,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:40:28" (2/3) ... [2024-11-07 19:40:29,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f711d9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:40:29, skipping insertion in model container [2024-11-07 19:40:29,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:40:29" (3/3) ... [2024-11-07 19:40:29,600 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_bad.i [2024-11-07 19:40:29,613 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:40:29,614 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-07 19:40:29,614 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 19:40:29,683 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-07 19:40:29,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 58 transitions, 130 flow [2024-11-07 19:40:29,746 INFO L124 PetriNetUnfolderBase]: 10/56 cut-off events. [2024-11-07 19:40:29,748 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 19:40:29,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 56 events. 10/56 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 150 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2024-11-07 19:40:29,752 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 58 transitions, 130 flow [2024-11-07 19:40:29,756 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 55 transitions, 122 flow [2024-11-07 19:40:29,766 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:40:29,777 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;@6e233f59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:40:29,777 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-07 19:40:29,792 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:40:29,792 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2024-11-07 19:40:29,792 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 19:40:29,793 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:40:29,793 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:40:29,793 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:40:29,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:40:29,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1771818407, now seen corresponding path program 1 times [2024-11-07 19:40:29,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:40:29,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852074190] [2024-11-07 19:40:29,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:40:29,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:40:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:40:30,216 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:40:30,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:40:30,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852074190] [2024-11-07 19:40:30,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852074190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:40:30,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:40:30,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:40:30,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019092050] [2024-11-07 19:40:30,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:40:30,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:40:30,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:40:30,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:40:30,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:40:30,268 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2024-11-07 19:40:30,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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:40:30,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:40:30,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2024-11-07 19:40:30,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:40:30,507 INFO L124 PetriNetUnfolderBase]: 445/831 cut-off events. [2024-11-07 19:40:30,507 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-11-07 19:40:30,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1580 conditions, 831 events. 445/831 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4279 event pairs, 330 based on Foata normal form. 90/846 useless extension candidates. Maximal degree in co-relation 1498. Up to 710 conditions per place. [2024-11-07 19:40:30,520 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 29 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2024-11-07 19:40:30,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 166 flow [2024-11-07 19:40:30,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:40:30,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:40:30,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-11-07 19:40:30,538 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2024-11-07 19:40:30,540 INFO L175 Difference]: Start difference. First operand has 52 places, 55 transitions, 122 flow. Second operand 3 states and 93 transitions. [2024-11-07 19:40:30,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 166 flow [2024-11-07 19:40:30,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 158 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 19:40:30,549 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 100 flow [2024-11-07 19:40:30,553 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=46, PETRI_TRANSITIONS=47} [2024-11-07 19:40:30,557 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2024-11-07 19:40:30,557 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 100 flow [2024-11-07 19:40:30,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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:40:30,558 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:40:30,558 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:40:30,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 19:40:30,558 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:40:30,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:40:30,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1771818408, now seen corresponding path program 1 times [2024-11-07 19:40:30,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:40:30,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740631947] [2024-11-07 19:40:30,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:40:30,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:40:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:40:30,898 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:40:30,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:40:30,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740631947] [2024-11-07 19:40:30,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740631947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:40:30,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:40:30,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:40:30,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250892105] [2024-11-07 19:40:30,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:40:30,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:40:30,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:40:30,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:40:30,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:40:30,925 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-11-07 19:40:30,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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:40:30,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:40:30,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-11-07 19:40:30,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:40:31,196 INFO L124 PetriNetUnfolderBase]: 788/1475 cut-off events. [2024-11-07 19:40:31,197 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-07 19:40:31,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2710 conditions, 1475 events. 788/1475 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 7756 event pairs, 263 based on Foata normal form. 0/1363 useless extension candidates. Maximal degree in co-relation 2704. Up to 697 conditions per place. [2024-11-07 19:40:31,206 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 53 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-11-07 19:40:31,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 71 transitions, 261 flow [2024-11-07 19:40:31,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:40:31,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:40:31,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2024-11-07 19:40:31,207 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6724137931034483 [2024-11-07 19:40:31,207 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 100 flow. Second operand 3 states and 117 transitions. [2024-11-07 19:40:31,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 71 transitions, 261 flow [2024-11-07 19:40:31,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:40:31,211 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 113 flow [2024-11-07 19:40:31,211 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=48, PETRI_TRANSITIONS=48} [2024-11-07 19:40:31,212 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2024-11-07 19:40:31,214 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 113 flow [2024-11-07 19:40:31,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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:40:31,214 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:40:31,214 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:40:31,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 19:40:31,215 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:40:31,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:40:31,215 INFO L85 PathProgramCache]: Analyzing trace with hash -905436107, now seen corresponding path program 1 times [2024-11-07 19:40:31,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:40:31,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022381353] [2024-11-07 19:40:31,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:40:31,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:40:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:40:31,423 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:40:31,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:40:31,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022381353] [2024-11-07 19:40:31,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022381353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:40:31,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:40:31,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:40:31,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838717851] [2024-11-07 19:40:31,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:40:31,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:40:31,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:40:31,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:40:31,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:40:31,432 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2024-11-07 19:40:31,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 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:40:31,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:40:31,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2024-11-07 19:40:31,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:40:31,636 INFO L124 PetriNetUnfolderBase]: 831/1494 cut-off events. [2024-11-07 19:40:31,637 INFO L125 PetriNetUnfolderBase]: For 51/61 co-relation queries the response was YES. [2024-11-07 19:40:31,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2928 conditions, 1494 events. 831/1494 cut-off events. For 51/61 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 7620 event pairs, 619 based on Foata normal form. 0/1372 useless extension candidates. Maximal degree in co-relation 2920. Up to 1298 conditions per place. [2024-11-07 19:40:31,647 INFO L140 encePairwiseOnDemand]: 56/58 looper letters, 31 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2024-11-07 19:40:31,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 171 flow [2024-11-07 19:40:31,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:40:31,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:40:31,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-11-07 19:40:31,649 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5114942528735632 [2024-11-07 19:40:31,649 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 113 flow. Second operand 3 states and 89 transitions. [2024-11-07 19:40:31,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 171 flow [2024-11-07 19:40:31,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 169 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:40:31,652 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 107 flow [2024-11-07 19:40:31,653 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2024-11-07 19:40:31,654 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2024-11-07 19:40:31,654 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 107 flow [2024-11-07 19:40:31,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 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:40:31,655 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:40:31,655 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:40:31,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 19:40:31,655 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:40:31,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:40:31,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1748481119, now seen corresponding path program 1 times [2024-11-07 19:40:31,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:40:31,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334383629] [2024-11-07 19:40:31,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:40:31,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:40:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:40:31,698 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:40:31,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:40:31,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334383629] [2024-11-07 19:40:31,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334383629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:40:31,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:40:31,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:40:31,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916802837] [2024-11-07 19:40:31,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:40:31,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:40:31,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:40:31,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:40:31,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:40:31,703 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-07 19:40:31,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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:40:31,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:40:31,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-07 19:40:31,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:40:31,959 INFO L124 PetriNetUnfolderBase]: 1091/1969 cut-off events. [2024-11-07 19:40:31,959 INFO L125 PetriNetUnfolderBase]: For 98/118 co-relation queries the response was YES. [2024-11-07 19:40:31,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3812 conditions, 1969 events. 1091/1969 cut-off events. For 98/118 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 11229 event pairs, 517 based on Foata normal form. 24/1879 useless extension candidates. Maximal degree in co-relation 3803. Up to 1179 conditions per place. [2024-11-07 19:40:31,973 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 51 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2024-11-07 19:40:31,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 68 transitions, 264 flow [2024-11-07 19:40:31,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:40:31,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:40:31,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-11-07 19:40:31,976 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-07 19:40:31,976 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 107 flow. Second operand 3 states and 116 transitions. [2024-11-07 19:40:31,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 68 transitions, 264 flow [2024-11-07 19:40:31,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 68 transitions, 263 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:40:31,979 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 118 flow [2024-11-07 19:40:31,980 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2024-11-07 19:40:31,980 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2024-11-07 19:40:31,980 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 118 flow [2024-11-07 19:40:31,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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:40:31,981 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:40:31,981 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:40:31,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 19:40:31,981 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:40:31,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:40:31,982 INFO L85 PathProgramCache]: Analyzing trace with hash 2083016124, now seen corresponding path program 1 times [2024-11-07 19:40:31,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:40:31,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896909104] [2024-11-07 19:40:31,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:40:31,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:40:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:40:32,051 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:40:32,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:40:32,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896909104] [2024-11-07 19:40:32,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896909104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:40:32,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:40:32,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:40:32,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085762452] [2024-11-07 19:40:32,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:40:32,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:40:32,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:40:32,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:40:32,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:40:32,057 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-07 19:40:32,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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:40:32,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:40:32,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-07 19:40:32,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:40:32,315 INFO L124 PetriNetUnfolderBase]: 1302/2462 cut-off events. [2024-11-07 19:40:32,316 INFO L125 PetriNetUnfolderBase]: For 238/254 co-relation queries the response was YES. [2024-11-07 19:40:32,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4948 conditions, 2462 events. 1302/2462 cut-off events. For 238/254 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 14239 event pairs, 482 based on Foata normal form. 42/2437 useless extension candidates. Maximal degree in co-relation 4938. Up to 1291 conditions per place. [2024-11-07 19:40:32,331 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 48 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2024-11-07 19:40:32,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 66 transitions, 274 flow [2024-11-07 19:40:32,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:40:32,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:40:32,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2024-11-07 19:40:32,335 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6379310344827587 [2024-11-07 19:40:32,335 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 118 flow. Second operand 3 states and 111 transitions. [2024-11-07 19:40:32,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 66 transitions, 274 flow [2024-11-07 19:40:32,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 66 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:40:32,337 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 131 flow [2024-11-07 19:40:32,337 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2024-11-07 19:40:32,337 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2024-11-07 19:40:32,338 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 131 flow [2024-11-07 19:40:32,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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:40:32,338 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:40:32,338 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:40:32,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 19:40:32,338 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:40:32,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:40:32,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1501292205, now seen corresponding path program 1 times [2024-11-07 19:40:32,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:40:32,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51829841] [2024-11-07 19:40:32,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:40:32,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:40:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:40:32,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:40:32,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:40:32,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51829841] [2024-11-07 19:40:32,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51829841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:40:32,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:40:32,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:40:32,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848824326] [2024-11-07 19:40:32,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:40:32,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:40:32,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:40:32,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:40:32,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:40:32,391 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-07 19:40:32,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 131 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:40:32,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:40:32,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-07 19:40:32,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:40:32,785 INFO L124 PetriNetUnfolderBase]: 2134/4056 cut-off events. [2024-11-07 19:40:32,785 INFO L125 PetriNetUnfolderBase]: For 732/764 co-relation queries the response was YES. [2024-11-07 19:40:32,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8472 conditions, 4056 events. 2134/4056 cut-off events. For 732/764 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 26283 event pairs, 979 based on Foata normal form. 69/3997 useless extension candidates. Maximal degree in co-relation 8460. Up to 2082 conditions per place. [2024-11-07 19:40:32,809 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 55 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2024-11-07 19:40:32,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 72 transitions, 320 flow [2024-11-07 19:40:32,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:40:32,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:40:32,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2024-11-07 19:40:32,811 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6609195402298851 [2024-11-07 19:40:32,811 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 131 flow. Second operand 3 states and 115 transitions. [2024-11-07 19:40:32,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 72 transitions, 320 flow [2024-11-07 19:40:32,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 72 transitions, 315 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:40:32,815 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 140 flow [2024-11-07 19:40:32,815 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2024-11-07 19:40:32,816 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2024-11-07 19:40:32,816 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 140 flow [2024-11-07 19:40:32,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:40:32,818 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:40:32,818 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:40:32,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 19:40:32,818 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:40:32,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:40:32,818 INFO L85 PathProgramCache]: Analyzing trace with hash 825924090, now seen corresponding path program 1 times [2024-11-07 19:40:32,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:40:32,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019344813] [2024-11-07 19:40:32,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:40:32,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:40:32,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:40:32,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:40:32,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:40:32,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019344813] [2024-11-07 19:40:32,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019344813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:40:32,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:40:32,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:40:32,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119035946] [2024-11-07 19:40:32,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:40:32,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:40:32,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:40:32,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:40:32,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:40:32,928 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-07 19:40:32,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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:40:32,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:40:32,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-07 19:40:32,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:40:33,207 INFO L124 PetriNetUnfolderBase]: 1676/3225 cut-off events. [2024-11-07 19:40:33,208 INFO L125 PetriNetUnfolderBase]: For 685/691 co-relation queries the response was YES. [2024-11-07 19:40:33,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6983 conditions, 3225 events. 1676/3225 cut-off events. For 685/691 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 20188 event pairs, 739 based on Foata normal form. 86/3221 useless extension candidates. Maximal degree in co-relation 6970. Up to 1575 conditions per place. [2024-11-07 19:40:33,227 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 46 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2024-11-07 19:40:33,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 63 transitions, 283 flow [2024-11-07 19:40:33,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:40:33,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:40:33,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-11-07 19:40:33,230 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6149425287356322 [2024-11-07 19:40:33,230 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 140 flow. Second operand 3 states and 107 transitions. [2024-11-07 19:40:33,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 63 transitions, 283 flow [2024-11-07 19:40:33,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 63 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:40:33,236 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 139 flow [2024-11-07 19:40:33,236 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2024-11-07 19:40:33,237 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2024-11-07 19:40:33,237 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 139 flow [2024-11-07 19:40:33,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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:40:33,239 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:40:33,239 INFO L204 CegarLoopForPetriNet]: trace histogram [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:40:33,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 19:40:33,239 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:40:33,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:40:33,240 INFO L85 PathProgramCache]: Analyzing trace with hash -789003703, now seen corresponding path program 1 times [2024-11-07 19:40:33,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:40:33,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294668820] [2024-11-07 19:40:33,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:40:33,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:40:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:40:33,352 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:40:33,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:40:33,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294668820] [2024-11-07 19:40:33,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294668820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:40:33,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:40:33,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:40:33,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941889637] [2024-11-07 19:40:33,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:40:33,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:40:33,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:40:33,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:40:33,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:40:33,354 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-07 19:40:33,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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:40:33,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:40:33,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-07 19:40:33,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:40:33,556 INFO L124 PetriNetUnfolderBase]: 1070/2324 cut-off events. [2024-11-07 19:40:33,556 INFO L125 PetriNetUnfolderBase]: For 786/786 co-relation queries the response was YES. [2024-11-07 19:40:33,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5098 conditions, 2324 events. 1070/2324 cut-off events. For 786/786 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 14082 event pairs, 335 based on Foata normal form. 126/2408 useless extension candidates. Maximal degree in co-relation 5085. Up to 1144 conditions per place. [2024-11-07 19:40:33,569 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 40 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2024-11-07 19:40:33,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 269 flow [2024-11-07 19:40:33,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:40:33,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:40:33,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-11-07 19:40:33,571 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5977011494252874 [2024-11-07 19:40:33,571 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 139 flow. Second operand 3 states and 104 transitions. [2024-11-07 19:40:33,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 269 flow [2024-11-07 19:40:33,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 265 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:40:33,578 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 143 flow [2024-11-07 19:40:33,579 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=143, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2024-11-07 19:40:33,580 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2024-11-07 19:40:33,580 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 143 flow [2024-11-07 19:40:33,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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:40:33,580 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:40:33,580 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:40:33,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 19:40:33,580 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:40:33,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:40:33,581 INFO L85 PathProgramCache]: Analyzing trace with hash -530676748, now seen corresponding path program 1 times [2024-11-07 19:40:33,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:40:33,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515650599] [2024-11-07 19:40:33,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:40:33,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:40:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:40:33,907 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:40:33,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:40:33,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515650599] [2024-11-07 19:40:33,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515650599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:40:33,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:40:33,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:40:33,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320867471] [2024-11-07 19:40:33,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:40:33,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:40:33,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:40:33,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:40:33,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:40:33,935 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2024-11-07 19:40:33,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 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:40:33,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:40:33,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2024-11-07 19:40:33,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:40:34,349 INFO L124 PetriNetUnfolderBase]: 1622/3383 cut-off events. [2024-11-07 19:40:34,349 INFO L125 PetriNetUnfolderBase]: For 1252/1252 co-relation queries the response was YES. [2024-11-07 19:40:34,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7868 conditions, 3383 events. 1622/3383 cut-off events. For 1252/1252 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 19607 event pairs, 664 based on Foata normal form. 0/3263 useless extension candidates. Maximal degree in co-relation 7855. Up to 979 conditions per place. [2024-11-07 19:40:34,367 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 104 selfloop transitions, 4 changer transitions 0/121 dead transitions. [2024-11-07 19:40:34,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 121 transitions, 608 flow [2024-11-07 19:40:34,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:40:34,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:40:34,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 198 transitions. [2024-11-07 19:40:34,368 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6827586206896552 [2024-11-07 19:40:34,368 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 143 flow. Second operand 5 states and 198 transitions. [2024-11-07 19:40:34,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 121 transitions, 608 flow [2024-11-07 19:40:34,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 121 transitions, 592 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:40:34,373 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 161 flow [2024-11-07 19:40:34,373 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=161, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2024-11-07 19:40:34,374 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2024-11-07 19:40:34,374 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 161 flow [2024-11-07 19:40:34,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 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:40:34,374 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:40:34,374 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:40:34,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 19:40:34,374 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:40:34,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:40:34,375 INFO L85 PathProgramCache]: Analyzing trace with hash 586333674, now seen corresponding path program 1 times [2024-11-07 19:40:34,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:40:34,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168315972] [2024-11-07 19:40:34,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:40:34,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:40:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:40:34,511 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:40:34,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:40:34,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168315972] [2024-11-07 19:40:34,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168315972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:40:34,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:40:34,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:40:34,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933409444] [2024-11-07 19:40:34,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:40:34,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:40:34,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:40:34,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:40:34,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:40:34,519 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-07 19:40:34,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 161 flow. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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:40:34,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:40:34,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-07 19:40:34,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:40:34,779 INFO L124 PetriNetUnfolderBase]: 1237/2618 cut-off events. [2024-11-07 19:40:34,779 INFO L125 PetriNetUnfolderBase]: For 1018/1024 co-relation queries the response was YES. [2024-11-07 19:40:34,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5988 conditions, 2618 events. 1237/2618 cut-off events. For 1018/1024 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 14380 event pairs, 516 based on Foata normal form. 28/2572 useless extension candidates. Maximal degree in co-relation 5972. Up to 1667 conditions per place. [2024-11-07 19:40:34,789 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 49 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2024-11-07 19:40:34,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 66 transitions, 320 flow [2024-11-07 19:40:34,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:40:34,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:40:34,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-11-07 19:40:34,790 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6264367816091954 [2024-11-07 19:40:34,790 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 161 flow. Second operand 3 states and 109 transitions. [2024-11-07 19:40:34,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 66 transitions, 320 flow [2024-11-07 19:40:34,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 66 transitions, 312 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-07 19:40:34,793 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 161 flow [2024-11-07 19:40:34,793 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2024-11-07 19:40:34,794 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2024-11-07 19:40:34,794 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 161 flow [2024-11-07 19:40:34,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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:40:34,794 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:40:34,794 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:40:34,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 19:40:34,794 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:40:34,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:40:34,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1790993317, now seen corresponding path program 1 times [2024-11-07 19:40:34,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:40:34,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147238752] [2024-11-07 19:40:34,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:40:34,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:40:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:40:34,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:40:34,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:40:34,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147238752] [2024-11-07 19:40:34,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147238752] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:40:34,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206417309] [2024-11-07 19:40:34,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:40:34,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:40:34,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:40:34,851 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:40:34,853 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:40:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:40:34,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 19:40:34,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:40:35,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 19:40:35,001 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:40:35,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206417309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:40:35,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 19:40:35,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2024-11-07 19:40:35,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200639119] [2024-11-07 19:40:35,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:40:35,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:40:35,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:40:35,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:40:35,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:40:35,014 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-11-07 19:40:35,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 161 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:40:35,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:40:35,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-11-07 19:40:35,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:40:35,243 INFO L124 PetriNetUnfolderBase]: 1237/2597 cut-off events. [2024-11-07 19:40:35,243 INFO L125 PetriNetUnfolderBase]: For 967/973 co-relation queries the response was YES. [2024-11-07 19:40:35,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6029 conditions, 2597 events. 1237/2597 cut-off events. For 967/973 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 14410 event pairs, 975 based on Foata normal form. 7/2522 useless extension candidates. Maximal degree in co-relation 6011. Up to 2069 conditions per place. [2024-11-07 19:40:35,251 INFO L140 encePairwiseOnDemand]: 56/58 looper letters, 32 selfloop transitions, 1 changer transitions 2/48 dead transitions. [2024-11-07 19:40:35,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 48 transitions, 227 flow [2024-11-07 19:40:35,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:40:35,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:40:35,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-11-07 19:40:35,253 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5172413793103449 [2024-11-07 19:40:35,253 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 161 flow. Second operand 3 states and 90 transitions. [2024-11-07 19:40:35,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 48 transitions, 227 flow [2024-11-07 19:40:35,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 48 transitions, 223 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:40:35,255 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 152 flow [2024-11-07 19:40:35,255 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-11-07 19:40:35,256 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2024-11-07 19:40:35,256 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 152 flow [2024-11-07 19:40:35,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:40:35,256 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:40:35,256 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:40:35,274 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:40:35,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-07 19:40:35,461 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:40:35,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:40:35,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1453075338, now seen corresponding path program 1 times [2024-11-07 19:40:35,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:40:35,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142646075] [2024-11-07 19:40:35,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:40:35,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:40:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 19:40:35,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [392473405] [2024-11-07 19:40:35,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:40:35,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:40:35,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:40:35,513 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:40:35,515 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:40:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:40:35,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 19:40:35,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:40:35,897 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:40:35,897 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:40:35,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:40:35,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142646075] [2024-11-07 19:40:35,898 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 19:40:35,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392473405] [2024-11-07 19:40:35,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392473405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:40:35,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:40:35,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:40:35,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453008134] [2024-11-07 19:40:35,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:40:35,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:40:35,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:40:35,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:40:35,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:40:35,914 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-07 19:40:35,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:40:35,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:40:35,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-07 19:40:35,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:40:36,138 INFO L124 PetriNetUnfolderBase]: 1008/2164 cut-off events. [2024-11-07 19:40:36,139 INFO L125 PetriNetUnfolderBase]: For 775/777 co-relation queries the response was YES. [2024-11-07 19:40:36,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4979 conditions, 2164 events. 1008/2164 cut-off events. For 775/777 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 11056 event pairs, 348 based on Foata normal form. 18/2132 useless extension candidates. Maximal degree in co-relation 4961. Up to 900 conditions per place. [2024-11-07 19:40:36,148 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 57 selfloop transitions, 3 changer transitions 3/76 dead transitions. [2024-11-07 19:40:36,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 76 transitions, 381 flow [2024-11-07 19:40:36,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:40:36,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:40:36,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2024-11-07 19:40:36,150 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6077586206896551 [2024-11-07 19:40:36,150 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 152 flow. Second operand 4 states and 141 transitions. [2024-11-07 19:40:36,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 76 transitions, 381 flow [2024-11-07 19:40:36,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 76 transitions, 380 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:40:36,154 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 161 flow [2024-11-07 19:40:36,154 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2024-11-07 19:40:36,155 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2024-11-07 19:40:36,155 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 161 flow [2024-11-07 19:40:36,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:40:36,155 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:40:36,155 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:40:36,174 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:40:36,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:40:36,356 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:40:36,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:40:36,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1459139867, now seen corresponding path program 1 times [2024-11-07 19:40:36,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:40:36,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774297969] [2024-11-07 19:40:36,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:40:36,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:40:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:40:37,294 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:40:37,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:40:37,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774297969] [2024-11-07 19:40:37,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774297969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:40:37,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:40:37,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 19:40:37,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638896353] [2024-11-07 19:40:37,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:40:37,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 19:40:37,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:40:37,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 19:40:37,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-07 19:40:37,506 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-07 19:40:37,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 161 flow. Second operand has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:40:37,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:40:37,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-07 19:40:37,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:40:38,376 INFO L124 PetriNetUnfolderBase]: 1174/2483 cut-off events. [2024-11-07 19:40:38,377 INFO L125 PetriNetUnfolderBase]: For 1128/1132 co-relation queries the response was YES. [2024-11-07 19:40:38,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5872 conditions, 2483 events. 1174/2483 cut-off events. For 1128/1132 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 13391 event pairs, 376 based on Foata normal form. 0/2429 useless extension candidates. Maximal degree in co-relation 5852. Up to 1326 conditions per place. [2024-11-07 19:40:38,388 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 94 selfloop transitions, 17 changer transitions 9/133 dead transitions. [2024-11-07 19:40:38,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 133 transitions, 705 flow [2024-11-07 19:40:38,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 19:40:38,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-07 19:40:38,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 362 transitions. [2024-11-07 19:40:38,391 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5201149425287356 [2024-11-07 19:40:38,391 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 161 flow. Second operand 12 states and 362 transitions. [2024-11-07 19:40:38,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 133 transitions, 705 flow [2024-11-07 19:40:38,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 133 transitions, 693 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 19:40:38,396 INFO L231 Difference]: Finished difference. Result has 75 places, 60 transitions, 295 flow [2024-11-07 19:40:38,396 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=295, PETRI_PLACES=75, PETRI_TRANSITIONS=60} [2024-11-07 19:40:38,396 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2024-11-07 19:40:38,397 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 60 transitions, 295 flow [2024-11-07 19:40:38,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:40:38,397 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:40:38,397 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:40:38,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 19:40:38,397 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:40:38,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:40:38,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1091154445, now seen corresponding path program 2 times [2024-11-07 19:40:38,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:40:38,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9487000] [2024-11-07 19:40:38,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:40:38,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:40:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:40:39,145 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:40:39,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:40:39,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9487000] [2024-11-07 19:40:39,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9487000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:40:39,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:40:39,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 19:40:39,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079930332] [2024-11-07 19:40:39,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:40:39,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 19:40:39,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:40:39,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 19:40:39,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-07 19:40:39,338 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-07 19:40:39,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 60 transitions, 295 flow. Second operand has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:40:39,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:40:39,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-07 19:40:39,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:40:40,120 INFO L124 PetriNetUnfolderBase]: 1403/2949 cut-off events. [2024-11-07 19:40:40,120 INFO L125 PetriNetUnfolderBase]: For 3141/3145 co-relation queries the response was YES. [2024-11-07 19:40:40,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8037 conditions, 2949 events. 1403/2949 cut-off events. For 3141/3145 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 16530 event pairs, 426 based on Foata normal form. 0/2894 useless extension candidates. Maximal degree in co-relation 8009. Up to 1651 conditions per place. [2024-11-07 19:40:40,133 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 103 selfloop transitions, 25 changer transitions 9/150 dead transitions. [2024-11-07 19:40:40,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 150 transitions, 982 flow [2024-11-07 19:40:40,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 19:40:40,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-07 19:40:40,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 365 transitions. [2024-11-07 19:40:40,138 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5244252873563219 [2024-11-07 19:40:40,138 INFO L175 Difference]: Start difference. First operand has 75 places, 60 transitions, 295 flow. Second operand 12 states and 365 transitions. [2024-11-07 19:40:40,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 150 transitions, 982 flow [2024-11-07 19:40:40,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 150 transitions, 960 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-07 19:40:40,150 INFO L231 Difference]: Finished difference. Result has 92 places, 80 transitions, 543 flow [2024-11-07 19:40:40,150 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=543, PETRI_PLACES=92, PETRI_TRANSITIONS=80} [2024-11-07 19:40:40,151 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 40 predicate places. [2024-11-07 19:40:40,151 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 80 transitions, 543 flow [2024-11-07 19:40:40,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:40:40,151 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:40:40,151 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:40:40,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 19:40:40,151 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:40:40,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:40:40,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1870763185, now seen corresponding path program 3 times [2024-11-07 19:40:40,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:40:40,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112292477] [2024-11-07 19:40:40,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:40:40,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:40:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:40:40,782 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:40:40,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:40:40,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112292477] [2024-11-07 19:40:40,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112292477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:40:40,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:40:40,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 19:40:40,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114336750] [2024-11-07 19:40:40,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:40:40,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 19:40:40,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:40:40,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 19:40:40,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 19:40:40,955 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-07 19:40:40,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 80 transitions, 543 flow. Second operand has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:40:40,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:40:40,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-07 19:40:40,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:40:41,824 INFO L124 PetriNetUnfolderBase]: 1567/3300 cut-off events. [2024-11-07 19:40:41,824 INFO L125 PetriNetUnfolderBase]: For 5552/5558 co-relation queries the response was YES. [2024-11-07 19:40:41,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9751 conditions, 3300 events. 1567/3300 cut-off events. For 5552/5558 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 19249 event pairs, 386 based on Foata normal form. 0/3249 useless extension candidates. Maximal degree in co-relation 9715. Up to 1679 conditions per place. [2024-11-07 19:40:41,840 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 111 selfloop transitions, 42 changer transitions 6/172 dead transitions. [2024-11-07 19:40:41,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 172 transitions, 1278 flow [2024-11-07 19:40:41,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 19:40:41,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-07 19:40:41,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 400 transitions. [2024-11-07 19:40:41,843 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5305039787798409 [2024-11-07 19:40:41,843 INFO L175 Difference]: Start difference. First operand has 92 places, 80 transitions, 543 flow. Second operand 13 states and 400 transitions. [2024-11-07 19:40:41,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 172 transitions, 1278 flow [2024-11-07 19:40:41,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 172 transitions, 1212 flow, removed 33 selfloop flow, removed 0 redundant places. [2024-11-07 19:40:41,860 INFO L231 Difference]: Finished difference. Result has 110 places, 95 transitions, 766 flow [2024-11-07 19:40:41,860 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=766, PETRI_PLACES=110, PETRI_TRANSITIONS=95} [2024-11-07 19:40:41,861 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 58 predicate places. [2024-11-07 19:40:41,861 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 95 transitions, 766 flow [2024-11-07 19:40:41,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:40:41,861 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:40:41,862 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:40:41,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 19:40:41,862 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:40:41,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:40:41,862 INFO L85 PathProgramCache]: Analyzing trace with hash 39143349, now seen corresponding path program 4 times [2024-11-07 19:40:41,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:40:41,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713473811] [2024-11-07 19:40:41,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:40:41,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:40:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:40:42,446 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:40:42,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:40:42,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713473811] [2024-11-07 19:40:42,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713473811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:40:42,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:40:42,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 19:40:42,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996972945] [2024-11-07 19:40:42,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:40:42,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 19:40:42,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:40:42,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 19:40:42,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 19:40:42,663 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-07 19:40:42,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 95 transitions, 766 flow. Second operand has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:40:42,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:40:42,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-07 19:40:42,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:40:43,626 INFO L124 PetriNetUnfolderBase]: 1807/3792 cut-off events. [2024-11-07 19:40:43,626 INFO L125 PetriNetUnfolderBase]: For 7980/7992 co-relation queries the response was YES. [2024-11-07 19:40:43,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11743 conditions, 3792 events. 1807/3792 cut-off events. For 7980/7992 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 22853 event pairs, 313 based on Foata normal form. 4/3750 useless extension candidates. Maximal degree in co-relation 11699. Up to 1290 conditions per place. [2024-11-07 19:40:43,655 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 118 selfloop transitions, 65 changer transitions 13/209 dead transitions. [2024-11-07 19:40:43,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 209 transitions, 1646 flow [2024-11-07 19:40:43,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 19:40:43,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-07 19:40:43,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 490 transitions. [2024-11-07 19:40:43,658 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5280172413793104 [2024-11-07 19:40:43,658 INFO L175 Difference]: Start difference. First operand has 110 places, 95 transitions, 766 flow. Second operand 16 states and 490 transitions. [2024-11-07 19:40:43,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 209 transitions, 1646 flow [2024-11-07 19:40:43,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 209 transitions, 1534 flow, removed 41 selfloop flow, removed 3 redundant places. [2024-11-07 19:40:43,687 INFO L231 Difference]: Finished difference. Result has 127 places, 108 transitions, 995 flow [2024-11-07 19:40:43,687 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=995, PETRI_PLACES=127, PETRI_TRANSITIONS=108} [2024-11-07 19:40:43,687 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 75 predicate places. [2024-11-07 19:40:43,688 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 108 transitions, 995 flow [2024-11-07 19:40:43,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:40:43,688 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:40:43,688 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:40:43,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 19:40:43,688 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:40:43,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:40:43,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1343068001, now seen corresponding path program 1 times [2024-11-07 19:40:43,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:40:43,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257221935] [2024-11-07 19:40:43,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:40:43,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:40:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:40:43,729 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:40:43,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:40:43,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257221935] [2024-11-07 19:40:43,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257221935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:40:43,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:40:43,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:40:43,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280513008] [2024-11-07 19:40:43,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:40:43,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:40:43,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:40:43,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:40:43,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:40:43,733 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-11-07 19:40:43,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 108 transitions, 995 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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:40:43,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:40:43,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-11-07 19:40:43,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:40:44,090 INFO L124 PetriNetUnfolderBase]: 1761/3575 cut-off events. [2024-11-07 19:40:44,091 INFO L125 PetriNetUnfolderBase]: For 7961/7973 co-relation queries the response was YES. [2024-11-07 19:40:44,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11567 conditions, 3575 events. 1761/3575 cut-off events. For 7961/7973 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 20562 event pairs, 442 based on Foata normal form. 35/3560 useless extension candidates. Maximal degree in co-relation 11519. Up to 2259 conditions per place. [2024-11-07 19:40:44,120 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 99 selfloop transitions, 7 changer transitions 11/129 dead transitions. [2024-11-07 19:40:44,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 129 transitions, 1359 flow [2024-11-07 19:40:44,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:40:44,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:40:44,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2024-11-07 19:40:44,121 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5919540229885057 [2024-11-07 19:40:44,121 INFO L175 Difference]: Start difference. First operand has 127 places, 108 transitions, 995 flow. Second operand 3 states and 103 transitions. [2024-11-07 19:40:44,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 129 transitions, 1359 flow [2024-11-07 19:40:44,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 129 transitions, 1136 flow, removed 31 selfloop flow, removed 13 redundant places. [2024-11-07 19:40:44,152 INFO L231 Difference]: Finished difference. Result has 118 places, 100 transitions, 767 flow [2024-11-07 19:40:44,152 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=767, PETRI_PLACES=118, PETRI_TRANSITIONS=100} [2024-11-07 19:40:44,153 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 66 predicate places. [2024-11-07 19:40:44,153 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 100 transitions, 767 flow [2024-11-07 19:40:44,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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:40:44,153 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:40:44,154 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1] [2024-11-07 19:40:44,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 19:40:44,154 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:40:44,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:40:44,154 INFO L85 PathProgramCache]: Analyzing trace with hash 2095745127, now seen corresponding path program 1 times [2024-11-07 19:40:44,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:40:44,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036806969] [2024-11-07 19:40:44,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:40:44,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:40:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 19:40:44,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1572979] [2024-11-07 19:40:44,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:40:44,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:40:44,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:40:44,179 INFO L229 MonitoredProcess]: Starting monitored process 4 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:40:44,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 19:40:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:40:44,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:40:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:40:44,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 19:40:44,442 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:40:44,443 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2024-11-07 19:40:44,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2024-11-07 19:40:44,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 15 remaining) [2024-11-07 19:40:44,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 15 remaining) [2024-11-07 19:40:44,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2024-11-07 19:40:44,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2024-11-07 19:40:44,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (8 of 15 remaining) [2024-11-07 19:40:44,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2024-11-07 19:40:44,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2024-11-07 19:40:44,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2024-11-07 19:40:44,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2024-11-07 19:40:44,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2024-11-07 19:40:44,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2024-11-07 19:40:44,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2024-11-07 19:40:44,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2024-11-07 19:40:44,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 19:40:44,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:40:44,649 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:40:44,701 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 19:40:44,702 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 19:40:44,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:40:44 BasicIcfg [2024-11-07 19:40:44,708 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 19:40:44,708 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 19:40:44,708 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 19:40:44,709 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 19:40:44,709 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:40:29" (3/4) ... [2024-11-07 19:40:44,712 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 19:40:44,713 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 19:40:44,714 INFO L158 Benchmark]: Toolchain (without parser) took 16513.12ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 91.0MB in the beginning and 193.8MB in the end (delta: -102.7MB). Peak memory consumption was 212.2MB. Max. memory is 16.1GB. [2024-11-07 19:40:44,715 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:40:44,716 INFO L158 Benchmark]: CACSL2BoogieTranslator took 521.37ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 70.4MB in the end (delta: 20.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 19:40:44,716 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.74ms. Allocated memory is still 117.4MB. Free memory was 70.4MB in the beginning and 68.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:40:44,716 INFO L158 Benchmark]: Boogie Preprocessor took 70.77ms. Allocated memory is still 117.4MB. Free memory was 68.4MB in the beginning and 66.0MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:40:44,717 INFO L158 Benchmark]: RCFGBuilder took 730.06ms. Allocated memory is still 117.4MB. Free memory was 66.0MB in the beginning and 66.3MB in the end (delta: -274.9kB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2024-11-07 19:40:44,717 INFO L158 Benchmark]: TraceAbstraction took 15113.95ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 65.9MB in the beginning and 193.9MB in the end (delta: -128.0MB). Peak memory consumption was 181.9MB. Max. memory is 16.1GB. [2024-11-07 19:40:44,717 INFO L158 Benchmark]: Witness Printer took 4.67ms. Allocated memory is still 427.8MB. Free memory was 193.9MB in the beginning and 193.8MB in the end (delta: 108.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 19:40:44,718 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.25ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 521.37ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 70.4MB in the end (delta: 20.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.74ms. Allocated memory is still 117.4MB. Free memory was 70.4MB in the beginning and 68.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 70.77ms. Allocated memory is still 117.4MB. Free memory was 68.4MB in the beginning and 66.0MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 730.06ms. Allocated memory is still 117.4MB. Free memory was 66.0MB in the beginning and 66.3MB in the end (delta: -274.9kB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15113.95ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 65.9MB in the beginning and 193.9MB in the end (delta: -128.0MB). Peak memory consumption was 181.9MB. Max. memory is 16.1GB. * Witness Printer took 4.67ms. Allocated memory is still 427.8MB. Free memory was 193.9MB in the beginning and 193.8MB in the end (delta: 108.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 681]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 681. Possible FailurePath: [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L683] 0 static unsigned int first; [L684] 0 static unsigned int next; [L685] 0 static int buffer_size; [L686] 0 _Bool send, receive; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L756] 0 pthread_t id1, id2; [L758] CALL 0 initLog(10) [L690] 0 buffer_size = max [L691] EXPR 0 next = 0 [L691] 0 first = next = 0 [L758] RET 0 initLog(10) [L759] 0 send=1 [L760] 0 receive=0 [L761] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1=-1, m={4:0}, next=0, receive=0, send=1] [L762] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1=-1, id2=0, m={4:0}, next=0, receive=0, send=1] [L739] 2 int i; [L740] 2 i=0 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L740] COND TRUE 2 i<7 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L743] COND FALSE 2 !(\read(receive)) VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L740] 2 i++ VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=1, m={4:0}, next=0, receive=0, send=1] [L723] 1 int i; [L724] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L724] COND TRUE 1 i<7 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L727] COND TRUE 1 \read(send) [L729] CALL 1 insertLogElement(i) [L707] COND TRUE 1 next < buffer_size && buffer_size > 0 VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L709] 1 buffer[next] = b [L710] 1 next = (next+1)%buffer_size VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=1, receive=0, send=1] [L712] COND TRUE 1 next 0 && first < buffer_size [L697] 2 first++ VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] [L698] EXPR 2 buffer[first-1] [L698] 2 return buffer[first-1]; [L745] RET, EXPR 2 removeLogElement() [L745] COND FALSE 2 !(removeLogElement()==i) [L746] CALL 2 reach_error() [L681] COND FALSE 2 !(0) VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] [L681] 2 __assert_fail ("0", "", 0, __extension__ __PRETTY_FUNCTION__) VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] - UnprovableResult [Line: 754]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 761]: 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: 762]: 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: 681]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 89 locations, 15 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: 14.9s, OverallIterations: 18, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1164 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1036 mSDsluCounter, 505 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 495 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4026 IncrementalHoareTripleChecker+Invalid, 4039 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 10 mSDtfsCounter, 4026 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 142 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=995occurred in iteration=16, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 461 NumberOfCodeBlocks, 461 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 354 ConstructedInterpolants, 0 QuantifiedInterpolants, 3178 SizeOfPredicates, 0 NumberOfNonLiveVariables, 395 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 18 InterpolantComputations, 17 PerfectInterpolantSequences, 15/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 19:40:44,754 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/pthread-deagle/circular_buffer_bad.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:40:47,039 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:40:47,173 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-07 19:40:47,180 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:40:47,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:40:47,212 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:40:47,213 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:40:47,213 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:40:47,214 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:40:47,214 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:40:47,214 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:40:47,215 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:40:47,215 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:40:47,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:40:47,215 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:40:47,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:40:47,216 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:40:47,216 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:40:47,216 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:40:47,216 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:40:47,216 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 19:40:47,216 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 19:40:47,216 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 19:40:47,216 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:40:47,216 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:40:47,216 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 19:40:47,216 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:40:47,216 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 19:40:47,216 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:40:47,216 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:40:47,216 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:40:47,216 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:40:47,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:40:47,217 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:40:47,217 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:40:47,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:40:47,217 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:40:47,217 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:40:47,217 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 19:40:47,217 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 19:40:47,217 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:40:47,217 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:40:47,217 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:40:47,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:40:47,217 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 -> a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc [2024-11-07 19:40:47,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:40:47,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:40:47,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:40:47,537 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:40:47,537 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:40:47,539 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2024-11-07 19:40:48,817 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:40:49,104 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:40:49,105 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2024-11-07 19:40:49,119 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da3a71ab0/fe73db3dcb854eb39cabcbda03e80d07/FLAGd6ae92801 [2024-11-07 19:40:49,136 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da3a71ab0/fe73db3dcb854eb39cabcbda03e80d07 [2024-11-07 19:40:49,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:40:49,140 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:40:49,141 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:40:49,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:40:49,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:40:49,146 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:40:49" (1/1) ... [2024-11-07 19:40:49,148 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@516d4b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:40:49, skipping insertion in model container [2024-11-07 19:40:49,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:40:49" (1/1) ... [2024-11-07 19:40:49,184 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:40:49,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:40:49,498 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:40:49,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:40:49,623 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:40:49,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:40:49 WrapperNode [2024-11-07 19:40:49,624 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:40:49,625 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:40:49,625 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:40:49,625 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:40:49,634 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:40:49" (1/1) ... [2024-11-07 19:40:49,657 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:40:49" (1/1) ... [2024-11-07 19:40:49,691 INFO L138 Inliner]: procedures = 175, calls = 40, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 141 [2024-11-07 19:40:49,691 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:40:49,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:40:49,692 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:40:49,692 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:40:49,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:40:49" (1/1) ... [2024-11-07 19:40:49,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:40:49" (1/1) ... [2024-11-07 19:40:49,706 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:40:49" (1/1) ... [2024-11-07 19:40:49,729 INFO L175 MemorySlicer]: Split 23 memory accesses to 4 slices as follows [2, 1, 12, 8]. 52 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 1, 10, 8]. The 1 writes are split as follows [0, 0, 1, 0]. [2024-11-07 19:40:49,732 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:40:49" (1/1) ... [2024-11-07 19:40:49,732 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:40:49" (1/1) ... [2024-11-07 19:40:49,746 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:40:49" (1/1) ... [2024-11-07 19:40:49,753 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:40:49" (1/1) ... [2024-11-07 19:40:49,759 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:40:49" (1/1) ... [2024-11-07 19:40:49,761 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:40:49" (1/1) ... [2024-11-07 19:40:49,766 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:40:49,772 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:40:49,773 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:40:49,773 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:40:49,774 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:40:49" (1/1) ... [2024-11-07 19:40:49,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:40:49,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:40:49,814 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:40:49,818 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:40:49,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 19:40:49,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 19:40:49,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-07 19:40:49,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-07 19:40:49,841 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-07 19:40:49,841 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-07 19:40:49,842 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-07 19:40:49,842 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-07 19:40:49,842 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-07 19:40:49,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:40:49,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 19:40:49,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 19:40:49,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-07 19:40:49,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-07 19:40:49,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-07 19:40:49,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-07 19:40:49,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-07 19:40:49,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-07 19:40:49,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-07 19:40:49,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-07 19:40:49,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-07 19:40:49,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-07 19:40:49,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 19:40:49,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 19:40:49,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-07 19:40:49,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-07 19:40:49,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-07 19:40:49,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-07 19:40:49,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-07 19:40:49,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-07 19:40:49,845 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-07 19:40:49,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:40:49,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:40:49,848 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:40:50,006 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:40:50,007 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:40:50,373 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 19:40:50,373 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:40:50,644 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:40:50,645 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 19:40:50,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:40:50 BoogieIcfgContainer [2024-11-07 19:40:50,646 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:40:50,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:40:50,648 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:40:50,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:40:50,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:40:49" (1/3) ... [2024-11-07 19:40:50,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497192bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:40:50, skipping insertion in model container [2024-11-07 19:40:50,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:40:49" (2/3) ... [2024-11-07 19:40:50,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497192bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:40:50, skipping insertion in model container [2024-11-07 19:40:50,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:40:50" (3/3) ... [2024-11-07 19:40:50,654 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_bad.i [2024-11-07 19:40:50,667 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:40:50,667 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-07 19:40:50,667 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 19:40:50,748 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-07 19:40:50,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 58 transitions, 130 flow [2024-11-07 19:40:50,821 INFO L124 PetriNetUnfolderBase]: 10/56 cut-off events. [2024-11-07 19:40:50,823 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 19:40:50,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 56 events. 10/56 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 150 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2024-11-07 19:40:50,827 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 58 transitions, 130 flow [2024-11-07 19:40:50,830 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 55 transitions, 122 flow [2024-11-07 19:40:50,837 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:40:50,848 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;@537dd8d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:40:50,849 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-07 19:40:50,857 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:40:50,857 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2024-11-07 19:40:50,857 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 19:40:50,857 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:40:50,858 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:40:50,858 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:40:50,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:40:50,863 INFO L85 PathProgramCache]: Analyzing trace with hash 746990759, now seen corresponding path program 1 times [2024-11-07 19:40:50,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:40:50,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2052759158] [2024-11-07 19:40:50,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:40:50,873 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:40:50,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:40:50,877 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:40:50,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 19:40:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:40:51,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:40:51,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:40:51,130 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:40:51,130 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:40:51,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:40:51,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2052759158] [2024-11-07 19:40:51,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2052759158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:40:51,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:40:51,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:40:51,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816453069] [2024-11-07 19:40:51,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:40:51,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:40:51,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:40:51,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:40:51,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:40:51,196 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2024-11-07 19:40:51,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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:40:51,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:40:51,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2024-11-07 19:40:51,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:40:51,481 INFO L124 PetriNetUnfolderBase]: 445/831 cut-off events. [2024-11-07 19:40:51,481 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-11-07 19:40:51,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1580 conditions, 831 events. 445/831 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4260 event pairs, 330 based on Foata normal form. 90/846 useless extension candidates. Maximal degree in co-relation 1498. Up to 710 conditions per place. [2024-11-07 19:40:51,490 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 29 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2024-11-07 19:40:51,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 166 flow [2024-11-07 19:40:51,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:40:51,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:40:51,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-11-07 19:40:51,502 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2024-11-07 19:40:51,503 INFO L175 Difference]: Start difference. First operand has 52 places, 55 transitions, 122 flow. Second operand 3 states and 93 transitions. [2024-11-07 19:40:51,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 166 flow [2024-11-07 19:40:51,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 158 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 19:40:51,513 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 100 flow [2024-11-07 19:40:51,516 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=46, PETRI_TRANSITIONS=47} [2024-11-07 19:40:51,520 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2024-11-07 19:40:51,521 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 100 flow [2024-11-07 19:40:51,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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:40:51,522 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:40:51,522 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:40:51,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 19:40:51,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:40:51,726 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:40:51,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:40:51,726 INFO L85 PathProgramCache]: Analyzing trace with hash 746990760, now seen corresponding path program 1 times [2024-11-07 19:40:51,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:40:51,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408452109] [2024-11-07 19:40:51,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:40:51,727 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:40:51,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:40:51,731 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:40:51,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 19:40:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:40:51,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 19:40:51,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:40:52,005 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:40:52,005 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:40:52,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:40:52,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1408452109] [2024-11-07 19:40:52,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1408452109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:40:52,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:40:52,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:40:52,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686467258] [2024-11-07 19:40:52,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:40:52,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:40:52,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:40:52,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:40:52,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:40:52,036 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-11-07 19:40:52,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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:40:52,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:40:52,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-11-07 19:40:52,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:40:52,363 INFO L124 PetriNetUnfolderBase]: 788/1475 cut-off events. [2024-11-07 19:40:52,363 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-07 19:40:52,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2710 conditions, 1475 events. 788/1475 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 7775 event pairs, 263 based on Foata normal form. 0/1363 useless extension candidates. Maximal degree in co-relation 2704. Up to 697 conditions per place. [2024-11-07 19:40:52,384 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 53 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-11-07 19:40:52,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 71 transitions, 261 flow [2024-11-07 19:40:52,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:40:52,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:40:52,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2024-11-07 19:40:52,388 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6724137931034483 [2024-11-07 19:40:52,388 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 100 flow. Second operand 3 states and 117 transitions. [2024-11-07 19:40:52,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 71 transitions, 261 flow [2024-11-07 19:40:52,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:40:52,392 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 113 flow [2024-11-07 19:40:52,393 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=48, PETRI_TRANSITIONS=48} [2024-11-07 19:40:52,393 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2024-11-07 19:40:52,394 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 113 flow [2024-11-07 19:40:52,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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:40:52,394 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:40:52,394 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:40:52,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-07 19:40:52,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:40:52,595 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:40:52,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:40:52,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1376607603, now seen corresponding path program 1 times [2024-11-07 19:40:52,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:40:52,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [533291576] [2024-11-07 19:40:52,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:40:52,596 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:40:52,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:40:52,598 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:40:52,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 19:40:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:40:52,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 19:40:52,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:40:52,817 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:40:52,817 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:40:52,817 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:40:52,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [533291576] [2024-11-07 19:40:52,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [533291576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:40:52,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:40:52,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:40:52,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106146384] [2024-11-07 19:40:52,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:40:52,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:40:52,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:40:52,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:40:52,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:40:52,842 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-07 19:40:52,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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:40:52,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:40:52,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-07 19:40:52,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:40:53,269 INFO L124 PetriNetUnfolderBase]: 986/1971 cut-off events. [2024-11-07 19:40:53,270 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2024-11-07 19:40:53,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3688 conditions, 1971 events. 986/1971 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 10779 event pairs, 195 based on Foata normal form. 75/1974 useless extension candidates. Maximal degree in co-relation 3680. Up to 626 conditions per place. [2024-11-07 19:40:53,281 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 74 selfloop transitions, 3 changer transitions 0/94 dead transitions. [2024-11-07 19:40:53,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 94 transitions, 369 flow [2024-11-07 19:40:53,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:40:53,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:40:53,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2024-11-07 19:40:53,283 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7068965517241379 [2024-11-07 19:40:53,283 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 113 flow. Second operand 4 states and 164 transitions. [2024-11-07 19:40:53,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 94 transitions, 369 flow [2024-11-07 19:40:53,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 94 transitions, 367 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:40:53,286 INFO L231 Difference]: Finished difference. Result has 52 places, 49 transitions, 133 flow [2024-11-07 19:40:53,286 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2024-11-07 19:40:53,287 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2024-11-07 19:40:53,287 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 133 flow [2024-11-07 19:40:53,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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:40:53,287 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:40:53,287 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:40:53,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 19:40:53,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:40:53,488 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:40:53,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:40:53,489 INFO L85 PathProgramCache]: Analyzing trace with hash -465349603, now seen corresponding path program 1 times [2024-11-07 19:40:53,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:40:53,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1486181955] [2024-11-07 19:40:53,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:40:53,489 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:40:53,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:40:53,491 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:40:53,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 19:40:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:40:53,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 19:40:53,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:40:53,594 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:40:53,595 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:40:53,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:40:53,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1486181955] [2024-11-07 19:40:53,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1486181955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:40:53,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:40:53,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:40:53,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891765718] [2024-11-07 19:40:53,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:40:53,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:40:53,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:40:53,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:40:53,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:40:53,600 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-07 19:40:53,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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:40:53,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:40:53,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-07 19:40:53,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:40:54,077 INFO L124 PetriNetUnfolderBase]: 1304/2502 cut-off events. [2024-11-07 19:40:54,078 INFO L125 PetriNetUnfolderBase]: For 547/567 co-relation queries the response was YES. [2024-11-07 19:40:54,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5003 conditions, 2502 events. 1304/2502 cut-off events. For 547/567 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 14887 event pairs, 728 based on Foata normal form. 24/2392 useless extension candidates. Maximal degree in co-relation 4992. Up to 1600 conditions per place. [2024-11-07 19:40:54,095 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 52 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-11-07 19:40:54,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 294 flow [2024-11-07 19:40:54,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:40:54,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:40:54,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-11-07 19:40:54,099 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-07 19:40:54,100 INFO L175 Difference]: Start difference. First operand has 52 places, 49 transitions, 133 flow. Second operand 3 states and 116 transitions. [2024-11-07 19:40:54,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 294 flow [2024-11-07 19:40:54,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 289 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:40:54,104 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 141 flow [2024-11-07 19:40:54,104 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2024-11-07 19:40:54,105 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2024-11-07 19:40:54,106 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 141 flow [2024-11-07 19:40:54,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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:40:54,106 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:40:54,106 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:40:54,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-07 19:40:54,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:40:54,310 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:40:54,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:40:54,311 INFO L85 PathProgramCache]: Analyzing trace with hash 398733114, now seen corresponding path program 1 times [2024-11-07 19:40:54,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:40:54,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505339606] [2024-11-07 19:40:54,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:40:54,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:40:54,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:40:54,317 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:40:54,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 19:40:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:40:54,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 19:40:54,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:40:54,417 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:40:54,417 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:40:54,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:40:54,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505339606] [2024-11-07 19:40:54,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [505339606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:40:54,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:40:54,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:40:54,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193075192] [2024-11-07 19:40:54,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:40:54,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:40:54,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:40:54,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:40:54,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:40:54,419 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-11-07 19:40:54,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 141 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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:40:54,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:40:54,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-11-07 19:40:54,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:40:54,840 INFO L124 PetriNetUnfolderBase]: 1343/2676 cut-off events. [2024-11-07 19:40:54,840 INFO L125 PetriNetUnfolderBase]: For 554/574 co-relation queries the response was YES. [2024-11-07 19:40:54,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5531 conditions, 2676 events. 1343/2676 cut-off events. For 554/574 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 15953 event pairs, 606 based on Foata normal form. 0/2575 useless extension candidates. Maximal degree in co-relation 5520. Up to 1181 conditions per place. [2024-11-07 19:40:54,855 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 52 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2024-11-07 19:40:54,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 72 transitions, 321 flow [2024-11-07 19:40:54,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:40:54,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:40:54,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2024-11-07 19:40:54,857 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6436781609195402 [2024-11-07 19:40:54,857 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 141 flow. Second operand 3 states and 112 transitions. [2024-11-07 19:40:54,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 72 transitions, 321 flow [2024-11-07 19:40:54,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 72 transitions, 318 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:40:54,859 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 165 flow [2024-11-07 19:40:54,860 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2024-11-07 19:40:54,860 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2024-11-07 19:40:54,860 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 165 flow [2024-11-07 19:40:54,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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:40:54,861 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:40:54,861 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:40:54,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-07 19:40:55,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:40:55,062 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:40:55,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:40:55,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1607237163, now seen corresponding path program 1 times [2024-11-07 19:40:55,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:40:55,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [783513689] [2024-11-07 19:40:55,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:40:55,064 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:40:55,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:40:55,066 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:40:55,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-07 19:40:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:40:55,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 19:40:55,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:40:55,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:40:55,161 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:40:55,161 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:40:55,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [783513689] [2024-11-07 19:40:55,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [783513689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:40:55,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:40:55,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:40:55,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653692073] [2024-11-07 19:40:55,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:40:55,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:40:55,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:40:55,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:40:55,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:40:55,165 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-11-07 19:40:55,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 165 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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:40:55,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:40:55,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-11-07 19:40:55,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:40:55,596 INFO L124 PetriNetUnfolderBase]: 1397/2801 cut-off events. [2024-11-07 19:40:55,597 INFO L125 PetriNetUnfolderBase]: For 856/900 co-relation queries the response was YES. [2024-11-07 19:40:55,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6020 conditions, 2801 events. 1397/2801 cut-off events. For 856/900 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 17360 event pairs, 532 based on Foata normal form. 0/2665 useless extension candidates. Maximal degree in co-relation 6006. Up to 1632 conditions per place. [2024-11-07 19:40:55,614 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 53 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2024-11-07 19:40:55,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 73 transitions, 346 flow [2024-11-07 19:40:55,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:40:55,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:40:55,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2024-11-07 19:40:55,616 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6379310344827587 [2024-11-07 19:40:55,616 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 165 flow. Second operand 3 states and 111 transitions. [2024-11-07 19:40:55,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 73 transitions, 346 flow [2024-11-07 19:40:55,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 73 transitions, 336 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:40:55,620 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 174 flow [2024-11-07 19:40:55,620 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2024-11-07 19:40:55,620 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2024-11-07 19:40:55,621 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 174 flow [2024-11-07 19:40:55,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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:40:55,622 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:40:55,622 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:40:55,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-07 19:40:55,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:40:55,823 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:40:55,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:40:55,823 INFO L85 PathProgramCache]: Analyzing trace with hash -864807880, now seen corresponding path program 1 times [2024-11-07 19:40:55,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:40:55,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465228050] [2024-11-07 19:40:55,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:40:55,823 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:40:55,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:40:55,825 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:40:55,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-07 19:40:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:40:55,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 19:40:55,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:40:55,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:40:55,991 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:40:55,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:40:55,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465228050] [2024-11-07 19:40:55,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1465228050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:40:55,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:40:55,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:40:55,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431534136] [2024-11-07 19:40:55,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:40:55,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:40:55,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:40:55,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:40:55,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:40:55,997 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-11-07 19:40:55,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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:40:55,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:40:55,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-11-07 19:40:55,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:40:56,267 INFO L124 PetriNetUnfolderBase]: 1014/2027 cut-off events. [2024-11-07 19:40:56,269 INFO L125 PetriNetUnfolderBase]: For 564/576 co-relation queries the response was YES. [2024-11-07 19:40:56,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4360 conditions, 2027 events. 1014/2027 cut-off events. For 564/576 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 10512 event pairs, 422 based on Foata normal form. 64/2043 useless extension candidates. Maximal degree in co-relation 4345. Up to 1083 conditions per place. [2024-11-07 19:40:56,281 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 47 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2024-11-07 19:40:56,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 66 transitions, 301 flow [2024-11-07 19:40:56,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:40:56,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:40:56,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-11-07 19:40:56,283 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6091954022988506 [2024-11-07 19:40:56,283 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 174 flow. Second operand 3 states and 106 transitions. [2024-11-07 19:40:56,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 66 transitions, 301 flow [2024-11-07 19:40:56,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 66 transitions, 293 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-07 19:40:56,287 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 164 flow [2024-11-07 19:40:56,287 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2024-11-07 19:40:56,288 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2024-11-07 19:40:56,289 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 164 flow [2024-11-07 19:40:56,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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:40:56,289 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:40:56,289 INFO L204 CegarLoopForPetriNet]: trace histogram [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:40:56,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-07 19:40:56,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:40:56,494 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:40:56,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:40:56,494 INFO L85 PathProgramCache]: Analyzing trace with hash -370566483, now seen corresponding path program 1 times [2024-11-07 19:40:56,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:40:56,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24058007] [2024-11-07 19:40:56,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:40:56,494 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:40:56,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:40:56,496 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:40:56,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-07 19:40:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:40:56,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 19:40:56,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:40:56,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-07 19:40:56,692 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:40:56,693 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:40:56,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:40:56,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24058007] [2024-11-07 19:40:56,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24058007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:40:56,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:40:56,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:40:56,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185329627] [2024-11-07 19:40:56,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:40:56,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:40:56,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:40:56,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:40:56,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:40:56,694 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-07 19:40:56,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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:40:56,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:40:56,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-07 19:40:56,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:40:56,959 INFO L124 PetriNetUnfolderBase]: 619/1417 cut-off events. [2024-11-07 19:40:56,959 INFO L125 PetriNetUnfolderBase]: For 423/423 co-relation queries the response was YES. [2024-11-07 19:40:56,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2997 conditions, 1417 events. 619/1417 cut-off events. For 423/423 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 6675 event pairs, 188 based on Foata normal form. 72/1453 useless extension candidates. Maximal degree in co-relation 2982. Up to 626 conditions per place. [2024-11-07 19:40:56,968 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 40 selfloop transitions, 4 changer transitions 0/62 dead transitions. [2024-11-07 19:40:56,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 62 transitions, 284 flow [2024-11-07 19:40:56,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:40:56,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:40:56,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2024-11-07 19:40:56,971 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.603448275862069 [2024-11-07 19:40:56,971 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 164 flow. Second operand 3 states and 105 transitions. [2024-11-07 19:40:56,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 62 transitions, 284 flow [2024-11-07 19:40:56,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 62 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:40:56,976 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 168 flow [2024-11-07 19:40:56,976 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2024-11-07 19:40:56,976 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2024-11-07 19:40:56,978 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 168 flow [2024-11-07 19:40:56,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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:40:56,978 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:40:56,978 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:40:56,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-07 19:40:57,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:40:57,179 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:40:57,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:40:57,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1230312578, now seen corresponding path program 1 times [2024-11-07 19:40:57,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:40:57,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [545045448] [2024-11-07 19:40:57,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:40:57,180 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:40:57,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:40:57,182 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:40:57,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-07 19:40:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:40:57,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 19:40:57,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:40:57,607 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:40:57,608 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:40:57,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:40:57,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [545045448] [2024-11-07 19:40:57,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [545045448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:40:57,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:40:57,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:40:57,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541337588] [2024-11-07 19:40:57,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:40:57,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:40:57,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:40:57,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:40:57,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:40:57,638 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-11-07 19:40:57,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:40:57,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:40:57,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-11-07 19:40:57,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:40:58,052 INFO L124 PetriNetUnfolderBase]: 1216/2661 cut-off events. [2024-11-07 19:40:58,052 INFO L125 PetriNetUnfolderBase]: For 983/983 co-relation queries the response was YES. [2024-11-07 19:40:58,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6000 conditions, 2661 events. 1216/2661 cut-off events. For 983/983 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 14477 event pairs, 625 based on Foata normal form. 0/2559 useless extension candidates. Maximal degree in co-relation 5985. Up to 1000 conditions per place. [2024-11-07 19:40:58,068 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 80 selfloop transitions, 3 changer transitions 0/100 dead transitions. [2024-11-07 19:40:58,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 100 transitions, 510 flow [2024-11-07 19:40:58,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:40:58,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:40:58,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2024-11-07 19:40:58,070 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6853448275862069 [2024-11-07 19:40:58,070 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 168 flow. Second operand 4 states and 159 transitions. [2024-11-07 19:40:58,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 100 transitions, 510 flow [2024-11-07 19:40:58,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 100 transitions, 498 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:40:58,075 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 180 flow [2024-11-07 19:40:58,076 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=180, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2024-11-07 19:40:58,077 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2024-11-07 19:40:58,077 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 180 flow [2024-11-07 19:40:58,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:40:58,078 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:40:58,078 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:40:58,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-07 19:40:58,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:40:58,279 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:40:58,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:40:58,279 INFO L85 PathProgramCache]: Analyzing trace with hash -2063220063, now seen corresponding path program 1 times [2024-11-07 19:40:58,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:40:58,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394565710] [2024-11-07 19:40:58,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:40:58,279 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:40:58,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:40:58,282 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:40:58,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-07 19:40:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:40:58,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 19:40:58,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:40:58,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:40:58,415 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:40:58,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:40:58,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394565710] [2024-11-07 19:40:58,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394565710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:40:58,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:40:58,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:40:58,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512602717] [2024-11-07 19:40:58,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:40:58,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:40:58,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:40:58,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:40:58,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:40:58,419 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-07 19:40:58,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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:40:58,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:40:58,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-07 19:40:58,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:40:58,809 INFO L124 PetriNetUnfolderBase]: 1500/3318 cut-off events. [2024-11-07 19:40:58,809 INFO L125 PetriNetUnfolderBase]: For 1126/1132 co-relation queries the response was YES. [2024-11-07 19:40:58,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7288 conditions, 3318 events. 1500/3318 cut-off events. For 1126/1132 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 19750 event pairs, 913 based on Foata normal form. 23/3255 useless extension candidates. Maximal degree in co-relation 7270. Up to 2099 conditions per place. [2024-11-07 19:40:58,830 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 57 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2024-11-07 19:40:58,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 385 flow [2024-11-07 19:40:58,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:40:58,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:40:58,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-11-07 19:40:58,832 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-07 19:40:58,832 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 180 flow. Second operand 3 states and 116 transitions. [2024-11-07 19:40:58,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 385 flow [2024-11-07 19:40:58,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 77 transitions, 385 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 19:40:58,836 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 192 flow [2024-11-07 19:40:58,836 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2024-11-07 19:40:58,837 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2024-11-07 19:40:58,837 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 192 flow [2024-11-07 19:40:58,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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:40:58,838 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:40:58,838 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:40:58,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-07 19:40:59,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:40:59,042 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:40:59,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:40:59,042 INFO L85 PathProgramCache]: Analyzing trace with hash -333457146, now seen corresponding path program 1 times [2024-11-07 19:40:59,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:40:59,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [536301055] [2024-11-07 19:40:59,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:40:59,043 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:40:59,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:40:59,047 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:40:59,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-07 19:40:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:40:59,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 19:40:59,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:40:59,380 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:40:59,381 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:40:59,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:40:59,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [536301055] [2024-11-07 19:40:59,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [536301055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:40:59,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:40:59,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:40:59,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557136845] [2024-11-07 19:40:59,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:40:59,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:40:59,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:40:59,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:40:59,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:40:59,420 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-07 19:40:59,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:40:59,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:40:59,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-07 19:40:59,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:40:59,832 INFO L124 PetriNetUnfolderBase]: 1060/2336 cut-off events. [2024-11-07 19:40:59,833 INFO L125 PetriNetUnfolderBase]: For 1049/1053 co-relation queries the response was YES. [2024-11-07 19:40:59,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5537 conditions, 2336 events. 1060/2336 cut-off events. For 1049/1053 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 11961 event pairs, 367 based on Foata normal form. 18/2303 useless extension candidates. Maximal degree in co-relation 5517. Up to 1219 conditions per place. [2024-11-07 19:40:59,847 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 59 selfloop transitions, 3 changer transitions 0/80 dead transitions. [2024-11-07 19:40:59,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 80 transitions, 409 flow [2024-11-07 19:40:59,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:40:59,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:40:59,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2024-11-07 19:40:59,848 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.603448275862069 [2024-11-07 19:40:59,848 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 192 flow. Second operand 4 states and 140 transitions. [2024-11-07 19:40:59,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 80 transitions, 409 flow [2024-11-07 19:40:59,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 80 transitions, 404 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:40:59,855 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 200 flow [2024-11-07 19:40:59,856 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2024-11-07 19:40:59,856 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 15 predicate places. [2024-11-07 19:40:59,856 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 200 flow [2024-11-07 19:40:59,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:40:59,856 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:40:59,856 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:40:59,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-07 19:41:00,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:41:00,057 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:41:00,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:41:00,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1044603421, now seen corresponding path program 1 times [2024-11-07 19:41:00,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:41:00,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40655633] [2024-11-07 19:41:00,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:41:00,058 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:41:00,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:41:00,060 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:41:00,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-07 19:41:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:41:00,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 19:41:00,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:41:00,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-07 19:41:00,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-07 19:41:00,609 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:41:00,609 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:41:00,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:41:00,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40655633] [2024-11-07 19:41:00,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40655633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:41:00,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:41:00,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 19:41:00,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672788825] [2024-11-07 19:41:00,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:41:00,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 19:41:00,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:41:00,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 19:41:00,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 19:41:00,789 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-07 19:41:00,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 200 flow. Second operand has 10 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 0 states have call successors, (0), 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:41:00,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:41:00,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-07 19:41:00,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:41:01,707 INFO L124 PetriNetUnfolderBase]: 1223/2688 cut-off events. [2024-11-07 19:41:01,707 INFO L125 PetriNetUnfolderBase]: For 1357/1363 co-relation queries the response was YES. [2024-11-07 19:41:01,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6409 conditions, 2688 events. 1223/2688 cut-off events. For 1357/1363 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 14413 event pairs, 423 based on Foata normal form. 0/2638 useless extension candidates. Maximal degree in co-relation 6387. Up to 1724 conditions per place. [2024-11-07 19:41:01,723 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 97 selfloop transitions, 14 changer transitions 0/129 dead transitions. [2024-11-07 19:41:01,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 129 transitions, 689 flow [2024-11-07 19:41:01,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 19:41:01,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-07 19:41:01,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 331 transitions. [2024-11-07 19:41:01,726 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5188087774294671 [2024-11-07 19:41:01,726 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 200 flow. Second operand 11 states and 331 transitions. [2024-11-07 19:41:01,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 129 transitions, 689 flow [2024-11-07 19:41:01,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 129 transitions, 680 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 19:41:01,730 INFO L231 Difference]: Finished difference. Result has 81 places, 65 transitions, 310 flow [2024-11-07 19:41:01,731 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=310, PETRI_PLACES=81, PETRI_TRANSITIONS=65} [2024-11-07 19:41:01,731 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 29 predicate places. [2024-11-07 19:41:01,731 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 65 transitions, 310 flow [2024-11-07 19:41:01,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 0 states have call successors, (0), 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:41:01,732 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:41:01,732 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:41:01,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-07 19:41:01,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:41:01,932 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:41:01,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:41:01,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1656545843, now seen corresponding path program 2 times [2024-11-07 19:41:01,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:41:01,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215432872] [2024-11-07 19:41:01,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 19:41:01,933 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:41:01,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:41:01,935 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:41:01,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-07 19:41:02,054 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 19:41:02,054 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:41:02,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 19:41:02,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:41:02,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-07 19:41:02,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-07 19:41:02,404 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:41:02,404 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:41:02,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:41:02,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1215432872] [2024-11-07 19:41:02,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1215432872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:41:02,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:41:02,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 19:41:02,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003358534] [2024-11-07 19:41:02,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:41:02,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 19:41:02,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:41:02,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 19:41:02,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-07 19:41:02,546 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-07 19:41:02,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 65 transitions, 310 flow. Second operand has 10 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 0 states have call successors, (0), 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:41:02,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:41:02,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-07 19:41:02,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:41:03,270 INFO L124 PetriNetUnfolderBase]: 1419/3091 cut-off events. [2024-11-07 19:41:03,270 INFO L125 PetriNetUnfolderBase]: For 2970/2976 co-relation queries the response was YES. [2024-11-07 19:41:03,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8241 conditions, 3091 events. 1419/3091 cut-off events. For 2970/2976 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 17181 event pairs, 494 based on Foata normal form. 0/3035 useless extension candidates. Maximal degree in co-relation 8213. Up to 2015 conditions per place. [2024-11-07 19:41:03,287 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 99 selfloop transitions, 20 changer transitions 0/137 dead transitions. [2024-11-07 19:41:03,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 137 transitions, 874 flow [2024-11-07 19:41:03,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 19:41:03,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-07 19:41:03,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 332 transitions. [2024-11-07 19:41:03,289 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5203761755485894 [2024-11-07 19:41:03,289 INFO L175 Difference]: Start difference. First operand has 81 places, 65 transitions, 310 flow. Second operand 11 states and 332 transitions. [2024-11-07 19:41:03,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 137 transitions, 874 flow [2024-11-07 19:41:03,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 137 transitions, 853 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-07 19:41:03,299 INFO L231 Difference]: Finished difference. Result has 95 places, 81 transitions, 512 flow [2024-11-07 19:41:03,299 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=512, PETRI_PLACES=95, PETRI_TRANSITIONS=81} [2024-11-07 19:41:03,300 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 43 predicate places. [2024-11-07 19:41:03,300 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 81 transitions, 512 flow [2024-11-07 19:41:03,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 0 states have call successors, (0), 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:41:03,300 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:41:03,300 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:41:03,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-07 19:41:03,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:41:03,501 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:41:03,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:41:03,502 INFO L85 PathProgramCache]: Analyzing trace with hash -148860277, now seen corresponding path program 3 times [2024-11-07 19:41:03,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:41:03,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [797422155] [2024-11-07 19:41:03,503 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 19:41:03,503 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:41:03,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:41:03,505 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:41:03,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-07 19:41:03,647 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-07 19:41:03,647 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:41:03,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 19:41:03,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:41:03,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-07 19:41:03,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-07 19:41:03,949 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:41:03,949 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:41:03,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:41:03,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [797422155] [2024-11-07 19:41:03,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [797422155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:41:03,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:41:03,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 19:41:03,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256385159] [2024-11-07 19:41:03,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:41:03,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 19:41:03,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:41:03,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 19:41:03,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 19:41:04,103 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-07 19:41:04,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 81 transitions, 512 flow. Second operand has 10 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 0 states have call successors, (0), 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:41:04,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:41:04,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-07 19:41:04,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:41:05,088 INFO L124 PetriNetUnfolderBase]: 1566/3406 cut-off events. [2024-11-07 19:41:05,089 INFO L125 PetriNetUnfolderBase]: For 4668/4676 co-relation queries the response was YES. [2024-11-07 19:41:05,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9693 conditions, 3406 events. 1566/3406 cut-off events. For 4668/4676 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 19519 event pairs, 491 based on Foata normal form. 0/3351 useless extension candidates. Maximal degree in co-relation 9659. Up to 2284 conditions per place. [2024-11-07 19:41:05,112 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 113 selfloop transitions, 20 changer transitions 0/151 dead transitions. [2024-11-07 19:41:05,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 151 transitions, 1093 flow [2024-11-07 19:41:05,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 19:41:05,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-07 19:41:05,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 333 transitions. [2024-11-07 19:41:05,115 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5219435736677116 [2024-11-07 19:41:05,116 INFO L175 Difference]: Start difference. First operand has 95 places, 81 transitions, 512 flow. Second operand 11 states and 333 transitions. [2024-11-07 19:41:05,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 151 transitions, 1093 flow [2024-11-07 19:41:05,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 151 transitions, 1035 flow, removed 29 selfloop flow, removed 0 redundant places. [2024-11-07 19:41:05,132 INFO L231 Difference]: Finished difference. Result has 111 places, 93 transitions, 659 flow [2024-11-07 19:41:05,132 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=659, PETRI_PLACES=111, PETRI_TRANSITIONS=93} [2024-11-07 19:41:05,132 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 59 predicate places. [2024-11-07 19:41:05,133 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 93 transitions, 659 flow [2024-11-07 19:41:05,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 0 states have call successors, (0), 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:41:05,133 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:41:05,133 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:41:05,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-07 19:41:05,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:41:05,334 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:41:05,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:41:05,335 INFO L85 PathProgramCache]: Analyzing trace with hash 323406515, now seen corresponding path program 4 times [2024-11-07 19:41:05,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:41:05,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074206846] [2024-11-07 19:41:05,335 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-07 19:41:05,335 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:41:05,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:41:05,338 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:41:05,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-07 19:41:05,507 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-07 19:41:05,507 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:41:05,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 19:41:05,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:41:05,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-07 19:41:05,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-07 19:41:05,886 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:41:05,886 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:41:05,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:41:05,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074206846] [2024-11-07 19:41:05,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2074206846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:41:05,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:41:05,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 19:41:05,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821178496] [2024-11-07 19:41:05,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:41:05,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 19:41:05,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:41:05,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 19:41:05,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-07 19:41:06,064 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-11-07 19:41:06,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 93 transitions, 659 flow. Second operand has 11 states, 11 states have (on average 21.636363636363637) internal successors, (238), 11 states have internal predecessors, (238), 0 states have call successors, (0), 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:41:06,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:41:06,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-11-07 19:41:06,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:41:07,062 INFO L124 PetriNetUnfolderBase]: 1607/3447 cut-off events. [2024-11-07 19:41:07,062 INFO L125 PetriNetUnfolderBase]: For 5235/5255 co-relation queries the response was YES. [2024-11-07 19:41:07,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10045 conditions, 3447 events. 1607/3447 cut-off events. For 5235/5255 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 19608 event pairs, 322 based on Foata normal form. 4/3413 useless extension candidates. Maximal degree in co-relation 10003. Up to 1179 conditions per place. [2024-11-07 19:41:07,079 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 114 selfloop transitions, 52 changer transitions 0/183 dead transitions. [2024-11-07 19:41:07,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 183 transitions, 1341 flow [2024-11-07 19:41:07,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 19:41:07,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-07 19:41:07,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 410 transitions. [2024-11-07 19:41:07,081 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5049261083743842 [2024-11-07 19:41:07,081 INFO L175 Difference]: Start difference. First operand has 111 places, 93 transitions, 659 flow. Second operand 14 states and 410 transitions. [2024-11-07 19:41:07,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 183 transitions, 1341 flow [2024-11-07 19:41:07,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 183 transitions, 1295 flow, removed 23 selfloop flow, removed 0 redundant places. [2024-11-07 19:41:07,101 INFO L231 Difference]: Finished difference. Result has 127 places, 100 transitions, 839 flow [2024-11-07 19:41:07,102 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=839, PETRI_PLACES=127, PETRI_TRANSITIONS=100} [2024-11-07 19:41:07,103 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 75 predicate places. [2024-11-07 19:41:07,103 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 100 transitions, 839 flow [2024-11-07 19:41:07,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 21.636363636363637) internal successors, (238), 11 states have internal predecessors, (238), 0 states have call successors, (0), 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:41:07,103 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:41:07,103 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:41:07,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-07 19:41:07,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:41:07,308 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:41:07,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:41:07,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1474539435, now seen corresponding path program 1 times [2024-11-07 19:41:07,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:41:07,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904302320] [2024-11-07 19:41:07,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:41:07,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:41:07,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:41:07,311 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:41:07,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-07 19:41:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:41:07,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:41:07,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:41:07,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:41:07,446 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:41:07,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:41:07,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:41:07,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904302320] [2024-11-07 19:41:07,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904302320] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:41:07,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 19:41:07,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-07 19:41:07,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563531987] [2024-11-07 19:41:07,481 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 19:41:07,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:41:07,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:41:07,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:41:07,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:41:07,486 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-11-07 19:41:07,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 100 transitions, 839 flow. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 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:41:07,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:41:07,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-11-07 19:41:07,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:41:08,447 INFO L124 PetriNetUnfolderBase]: 3271/6757 cut-off events. [2024-11-07 19:41:08,448 INFO L125 PetriNetUnfolderBase]: For 9814/9828 co-relation queries the response was YES. [2024-11-07 19:41:08,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19487 conditions, 6757 events. 3271/6757 cut-off events. For 9814/9828 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 42929 event pairs, 450 based on Foata normal form. 295/6955 useless extension candidates. Maximal degree in co-relation 19440. Up to 1411 conditions per place. [2024-11-07 19:41:08,518 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 149 selfloop transitions, 25 changer transitions 0/191 dead transitions. [2024-11-07 19:41:08,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 191 transitions, 1744 flow [2024-11-07 19:41:08,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:41:08,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:41:08,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 236 transitions. [2024-11-07 19:41:08,527 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6781609195402298 [2024-11-07 19:41:08,528 INFO L175 Difference]: Start difference. First operand has 127 places, 100 transitions, 839 flow. Second operand 6 states and 236 transitions. [2024-11-07 19:41:08,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 191 transitions, 1744 flow [2024-11-07 19:41:08,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 191 transitions, 1418 flow, removed 74 selfloop flow, removed 16 redundant places. [2024-11-07 19:41:08,619 INFO L231 Difference]: Finished difference. Result has 120 places, 103 transitions, 742 flow [2024-11-07 19:41:08,619 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=742, PETRI_PLACES=120, PETRI_TRANSITIONS=103} [2024-11-07 19:41:08,624 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 68 predicate places. [2024-11-07 19:41:08,624 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 103 transitions, 742 flow [2024-11-07 19:41:08,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 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:41:08,624 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:41:08,624 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1] [2024-11-07 19:41:08,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-07 19:41:08,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:41:08,825 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-07 19:41:08,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:41:08,826 INFO L85 PathProgramCache]: Analyzing trace with hash 405701161, now seen corresponding path program 1 times [2024-11-07 19:41:08,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:41:08,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1238627147] [2024-11-07 19:41:08,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:41:08,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:41:08,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:41:08,828 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:41:08,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-07 19:41:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:41:08,973 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:41:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:41:09,105 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-07 19:41:09,105 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:41:09,106 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2024-11-07 19:41:09,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2024-11-07 19:41:09,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 15 remaining) [2024-11-07 19:41:09,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 15 remaining) [2024-11-07 19:41:09,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2024-11-07 19:41:09,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2024-11-07 19:41:09,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (8 of 15 remaining) [2024-11-07 19:41:09,109 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2024-11-07 19:41:09,109 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2024-11-07 19:41:09,109 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2024-11-07 19:41:09,109 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2024-11-07 19:41:09,109 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2024-11-07 19:41:09,109 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2024-11-07 19:41:09,109 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2024-11-07 19:41:09,109 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2024-11-07 19:41:09,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-07 19:41:09,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:41:09,310 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:41:09,362 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 19:41:09,362 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 19:41:09,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:41:09 BasicIcfg [2024-11-07 19:41:09,367 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 19:41:09,368 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 19:41:09,368 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 19:41:09,368 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 19:41:09,369 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:40:50" (3/4) ... [2024-11-07 19:41:09,371 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 19:41:09,371 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 19:41:09,372 INFO L158 Benchmark]: Toolchain (without parser) took 20231.64ms. Allocated memory was 83.9MB in the beginning and 436.2MB in the end (delta: 352.3MB). Free memory was 60.3MB in the beginning and 255.7MB in the end (delta: -195.4MB). Peak memory consumption was 154.3MB. Max. memory is 16.1GB. [2024-11-07 19:41:09,372 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 83.9MB. Free memory was 66.0MB in the beginning and 65.9MB in the end (delta: 36.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:41:09,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.75ms. Allocated memory is still 83.9MB. Free memory was 60.1MB in the beginning and 38.7MB in the end (delta: 21.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 19:41:09,373 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.96ms. Allocated memory is still 83.9MB. Free memory was 38.7MB in the beginning and 36.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:41:09,373 INFO L158 Benchmark]: Boogie Preprocessor took 74.46ms. Allocated memory is still 83.9MB. Free memory was 36.5MB in the beginning and 33.9MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:41:09,373 INFO L158 Benchmark]: RCFGBuilder took 873.32ms. Allocated memory is still 83.9MB. Free memory was 33.6MB in the beginning and 30.0MB in the end (delta: 3.6MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2024-11-07 19:41:09,374 INFO L158 Benchmark]: TraceAbstraction took 18719.38ms. Allocated memory was 83.9MB in the beginning and 436.2MB in the end (delta: 352.3MB). Free memory was 29.5MB in the beginning and 255.7MB in the end (delta: -226.2MB). Peak memory consumption was 123.6MB. Max. memory is 16.1GB. [2024-11-07 19:41:09,374 INFO L158 Benchmark]: Witness Printer took 3.90ms. Allocated memory is still 436.2MB. Free memory was 255.7MB in the beginning and 255.7MB in the end (delta: 9.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:41:09,375 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.35ms. Allocated memory is still 83.9MB. Free memory was 66.0MB in the beginning and 65.9MB in the end (delta: 36.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 482.75ms. Allocated memory is still 83.9MB. Free memory was 60.1MB in the beginning and 38.7MB in the end (delta: 21.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.96ms. Allocated memory is still 83.9MB. Free memory was 38.7MB in the beginning and 36.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 74.46ms. Allocated memory is still 83.9MB. Free memory was 36.5MB in the beginning and 33.9MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 873.32ms. Allocated memory is still 83.9MB. Free memory was 33.6MB in the beginning and 30.0MB in the end (delta: 3.6MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * TraceAbstraction took 18719.38ms. Allocated memory was 83.9MB in the beginning and 436.2MB in the end (delta: 352.3MB). Free memory was 29.5MB in the beginning and 255.7MB in the end (delta: -226.2MB). Peak memory consumption was 123.6MB. Max. memory is 16.1GB. * Witness Printer took 3.90ms. Allocated memory is still 436.2MB. Free memory was 255.7MB in the beginning and 255.7MB in the end (delta: 9.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 681]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 681. Possible FailurePath: [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L683] 0 static unsigned int first; [L684] 0 static unsigned int next; [L685] 0 static int buffer_size; [L686] 0 _Bool send, receive; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L756] 0 pthread_t id1, id2; [L758] CALL 0 initLog(10) [L690] 0 buffer_size = max [L691] EXPR 0 next = 0 [L691] 0 first = next = 0 [L758] RET 0 initLog(10) [L759] 0 send=1 [L760] 0 receive=0 [L761] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1=0, m={4:0}, next=0, receive=0, send=1] [L723] 1 int i; [L724] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L762] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1=0, id2=1, m={4:0}, next=0, receive=0, send=1] [L739] 2 int i; [L740] 2 i=0 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L724] COND TRUE 1 i<7 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L740] COND TRUE 2 i<7 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L743] COND FALSE 2 !(\read(receive)) VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L727] COND TRUE 1 \read(send) [L729] CALL 1 insertLogElement(i) [L707] COND TRUE 1 next < buffer_size && buffer_size > 0 VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L709] 1 buffer[next] = b [L710] 1 next = (next+1)%buffer_size VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=1, receive=0, send=1] [L712] COND TRUE 1 next 0 && first < buffer_size [L697] 2 first++ VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] [L698] EXPR 2 buffer[first-1] [L698] 2 return buffer[first-1]; [L745] RET, EXPR 2 removeLogElement() [L745] COND FALSE 2 !(removeLogElement()==i) [L746] CALL 2 reach_error() [L681] COND FALSE 2 !(0) VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] [L681] 2 __assert_fail ("0", "", 0, __extension__ __PRETTY_FUNCTION__) VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] - UnprovableResult [Line: 754]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 761]: 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: 762]: 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: 681]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 89 locations, 15 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: 18.5s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1064 SdHoareTripleChecker+Valid, 5.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 945 mSDsluCounter, 487 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 463 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4028 IncrementalHoareTripleChecker+Invalid, 4044 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 24 mSDtfsCounter, 4028 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 354 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=839occurred in iteration=15, InterpolantAutomatonStates: 89, 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.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 354 NumberOfCodeBlocks, 354 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 335 ConstructedInterpolants, 0 QuantifiedInterpolants, 2530 SizeOfPredicates, 38 NumberOfNonLiveVariables, 1678 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 17 InterpolantComputations, 15 PerfectInterpolantSequences, 10/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 19:41:09,404 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 Result: UNKNOWN: Overapproximated counterexample