./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c --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/weaver/popl20-bad-counter-queue.wvr.c', '-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', '387879bf92b16ead997b40b3e249348f8a6b399496756f9bc3c41b6dc3c21353'] 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/weaver/popl20-bad-counter-queue.wvr.c -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 387879bf92b16ead997b40b3e249348f8a6b399496756f9bc3c41b6dc3c21353 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:33:10,280 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:33:10,369 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:33:10,376 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:33:10,376 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:33:10,405 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:33:10,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:33:10,407 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:33:10,408 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:33:10,408 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:33:10,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:33:10,409 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:33:10,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:33:10,409 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:33:10,409 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:33:10,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:33:10,410 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:33:10,411 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:33:10,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:33:10,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:33:10,411 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 19:33:10,411 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 19:33:10,411 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 19:33:10,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:33:10,411 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:33:10,411 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:33:10,411 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:33:10,411 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:33:10,411 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:33:10,411 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:33:10,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:33:10,412 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:33:10,412 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:33:10,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:33:10,412 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:33:10,412 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:33:10,412 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 19:33:10,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 19:33:10,412 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:33:10,413 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:33:10,413 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:33:10,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:33:10,413 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 -> 387879bf92b16ead997b40b3e249348f8a6b399496756f9bc3c41b6dc3c21353 [2024-11-07 19:33:10,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:33:10,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:33:10,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:33:10,730 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:33:10,730 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:33:10,731 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2024-11-07 19:33:12,020 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:33:12,224 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:33:12,224 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2024-11-07 19:33:12,231 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a8e4e313/bdb4ac9a522d47d6a2ebdefc18e4ee48/FLAGdc3e0aa0e [2024-11-07 19:33:12,593 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a8e4e313/bdb4ac9a522d47d6a2ebdefc18e4ee48 [2024-11-07 19:33:12,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:33:12,598 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:33:12,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:33:12,599 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:33:12,603 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:33:12,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:33:12" (1/1) ... [2024-11-07 19:33:12,605 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f5079e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:12, skipping insertion in model container [2024-11-07 19:33:12,606 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:33:12" (1/1) ... [2024-11-07 19:33:12,620 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:33:12,794 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 19:33:12,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:33:12,816 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:33:12,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:33:12,860 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:33:12,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:12 WrapperNode [2024-11-07 19:33:12,861 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:33:12,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:33:12,863 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:33:12,863 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:33:12,869 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:33:12" (1/1) ... [2024-11-07 19:33:12,877 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:33:12" (1/1) ... [2024-11-07 19:33:12,903 INFO L138 Inliner]: procedures = 23, calls = 23, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 136 [2024-11-07 19:33:12,907 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:33:12,908 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:33:12,908 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:33:12,908 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:33:12,919 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:12" (1/1) ... [2024-11-07 19:33:12,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:12" (1/1) ... [2024-11-07 19:33:12,926 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:12" (1/1) ... [2024-11-07 19:33:12,944 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-07 19:33:12,946 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:12" (1/1) ... [2024-11-07 19:33:12,946 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:12" (1/1) ... [2024-11-07 19:33:12,955 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:12" (1/1) ... [2024-11-07 19:33:12,958 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:12" (1/1) ... [2024-11-07 19:33:12,960 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:12" (1/1) ... [2024-11-07 19:33:12,960 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:12" (1/1) ... [2024-11-07 19:33:12,962 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:33:12,965 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:33:12,965 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:33:12,965 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:33:12,966 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:12" (1/1) ... [2024-11-07 19:33:12,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:33:12,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:33:13,001 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:33:13,007 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:33:13,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:33:13,026 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-07 19:33:13,027 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-07 19:33:13,027 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-07 19:33:13,027 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-07 19:33:13,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 19:33:13,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 19:33:13,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 19:33:13,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 19:33:13,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 19:33:13,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:33:13,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:33:13,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 19:33:13,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 19:33:13,029 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:33:13,113 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:33:13,115 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:33:13,434 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 19:33:13,434 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:33:13,661 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:33:13,661 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-07 19:33:13,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:33:13 BoogieIcfgContainer [2024-11-07 19:33:13,661 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:33:13,663 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:33:13,663 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:33:13,670 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:33:13,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:33:12" (1/3) ... [2024-11-07 19:33:13,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f84f7c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:33:13, skipping insertion in model container [2024-11-07 19:33:13,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:12" (2/3) ... [2024-11-07 19:33:13,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f84f7c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:33:13, skipping insertion in model container [2024-11-07 19:33:13,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:33:13" (3/3) ... [2024-11-07 19:33:13,672 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2024-11-07 19:33:13,686 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:33:13,686 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-07 19:33:13,687 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 19:33:13,745 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-07 19:33:13,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 35 transitions, 84 flow [2024-11-07 19:33:13,808 INFO L124 PetriNetUnfolderBase]: 3/33 cut-off events. [2024-11-07 19:33:13,811 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 19:33:13,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 33 events. 3/33 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2024-11-07 19:33:13,814 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 35 transitions, 84 flow [2024-11-07 19:33:13,816 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 32 transitions, 76 flow [2024-11-07 19:33:13,826 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:33:13,836 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;@10be118c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:33:13,836 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-07 19:33:13,843 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:33:13,843 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-07 19:33:13,843 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:33:13,844 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:13,844 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-07 19:33:13,845 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:33:13,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:13,849 INFO L85 PathProgramCache]: Analyzing trace with hash 454067, now seen corresponding path program 1 times [2024-11-07 19:33:13,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:33:13,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144054947] [2024-11-07 19:33:13,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:13,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:33:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:14,058 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:33:14,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:33:14,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144054947] [2024-11-07 19:33:14,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144054947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:33:14,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:33:14,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:33:14,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202525119] [2024-11-07 19:33:14,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:33:14,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:33:14,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:33:14,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:33:14,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:33:14,110 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-07 19:33:14,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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:33:14,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:14,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-07 19:33:14,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:14,200 INFO L124 PetriNetUnfolderBase]: 62/133 cut-off events. [2024-11-07 19:33:14,201 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-07 19:33:14,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 133 events. 62/133 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 454 event pairs, 42 based on Foata normal form. 1/118 useless extension candidates. Maximal degree in co-relation 220. Up to 109 conditions per place. [2024-11-07 19:33:14,204 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 17 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2024-11-07 19:33:14,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 108 flow [2024-11-07 19:33:14,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:33:14,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:33:14,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-11-07 19:33:14,218 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-11-07 19:33:14,219 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 76 flow. Second operand 3 states and 60 transitions. [2024-11-07 19:33:14,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 108 flow [2024-11-07 19:33:14,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 100 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 19:33:14,225 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 66 flow [2024-11-07 19:33:14,227 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2024-11-07 19:33:14,233 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2024-11-07 19:33:14,234 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 66 flow [2024-11-07 19:33:14,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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:33:14,234 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:14,234 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-07 19:33:14,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 19:33:14,235 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:33:14,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:14,235 INFO L85 PathProgramCache]: Analyzing trace with hash 454068, now seen corresponding path program 1 times [2024-11-07 19:33:14,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:33:14,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138060890] [2024-11-07 19:33:14,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:14,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:33:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:14,573 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:33:14,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:33:14,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138060890] [2024-11-07 19:33:14,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138060890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:33:14,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:33:14,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:33:14,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914859907] [2024-11-07 19:33:14,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:33:14,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:33:14,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:33:14,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:33:14,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:33:14,601 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-07 19:33:14,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:14,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:14,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-07 19:33:14,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:14,726 INFO L124 PetriNetUnfolderBase]: 63/136 cut-off events. [2024-11-07 19:33:14,726 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-07 19:33:14,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 136 events. 63/136 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 463 event pairs, 42 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 240. Up to 114 conditions per place. [2024-11-07 19:33:14,727 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 19 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2024-11-07 19:33:14,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 120 flow [2024-11-07 19:33:14,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:33:14,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:33:14,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2024-11-07 19:33:14,730 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-11-07 19:33:14,731 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 66 flow. Second operand 4 states and 76 transitions. [2024-11-07 19:33:14,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 120 flow [2024-11-07 19:33:14,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:33:14,733 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 89 flow [2024-11-07 19:33:14,733 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=89, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2024-11-07 19:33:14,735 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2024-11-07 19:33:14,735 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 89 flow [2024-11-07 19:33:14,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:14,735 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:14,736 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-11-07 19:33:14,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 19:33:14,736 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:33:14,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:14,737 INFO L85 PathProgramCache]: Analyzing trace with hash 436373278, now seen corresponding path program 1 times [2024-11-07 19:33:14,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:33:14,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394728783] [2024-11-07 19:33:14,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:14,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:33:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:15,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:33:15,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:33:15,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394728783] [2024-11-07 19:33:15,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394728783] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:33:15,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820331124] [2024-11-07 19:33:15,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:15,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:33:15,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:33:15,019 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:33:15,021 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:33:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:15,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 19:33:15,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:33:15,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-07 19:33:15,320 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:33:15,321 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:33:15,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:33:15,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820331124] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:33:15,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 19:33:15,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2024-11-07 19:33:15,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103755299] [2024-11-07 19:33:15,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 19:33:15,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 19:33:15,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:33:15,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 19:33:15,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 19:33:15,534 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-07 19:33:15,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 89 flow. Second operand has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 0 states have call successors, (0), 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:33:15,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:15,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-07 19:33:15,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:15,746 INFO L124 PetriNetUnfolderBase]: 63/135 cut-off events. [2024-11-07 19:33:15,746 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-07 19:33:15,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 135 events. 63/135 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 452 event pairs, 42 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 247. Up to 110 conditions per place. [2024-11-07 19:33:15,748 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 15 selfloop transitions, 7 changer transitions 0/31 dead transitions. [2024-11-07 19:33:15,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 31 transitions, 129 flow [2024-11-07 19:33:15,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:33:15,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:33:15,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-11-07 19:33:15,749 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2024-11-07 19:33:15,749 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 89 flow. Second operand 6 states and 101 transitions. [2024-11-07 19:33:15,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 31 transitions, 129 flow [2024-11-07 19:33:15,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 31 transitions, 126 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:33:15,751 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 96 flow [2024-11-07 19:33:15,751 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=96, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2024-11-07 19:33:15,751 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2024-11-07 19:33:15,751 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 96 flow [2024-11-07 19:33:15,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 0 states have call successors, (0), 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:33:15,752 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:15,752 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 19:33:15,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 19:33:15,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:33:15,953 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:33:15,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:15,953 INFO L85 PathProgramCache]: Analyzing trace with hash 644602332, now seen corresponding path program 1 times [2024-11-07 19:33:15,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:33:15,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53030221] [2024-11-07 19:33:15,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:15,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:33:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:16,020 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:33:16,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:33:16,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53030221] [2024-11-07 19:33:16,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53030221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:33:16,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:33:16,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:33:16,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230574867] [2024-11-07 19:33:16,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:33:16,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:33:16,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:33:16,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:33:16,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:33:16,034 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-07 19:33:16,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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:33:16,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:16,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-07 19:33:16,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:16,089 INFO L124 PetriNetUnfolderBase]: 63/130 cut-off events. [2024-11-07 19:33:16,089 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-07 19:33:16,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 130 events. 63/130 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 416 event pairs, 42 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 243. Up to 109 conditions per place. [2024-11-07 19:33:16,090 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 19 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2024-11-07 19:33:16,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 136 flow [2024-11-07 19:33:16,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:33:16,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:33:16,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2024-11-07 19:33:16,091 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-11-07 19:33:16,091 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 96 flow. Second operand 4 states and 65 transitions. [2024-11-07 19:33:16,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 136 flow [2024-11-07 19:33:16,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 106 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-11-07 19:33:16,093 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 68 flow [2024-11-07 19:33:16,093 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2024-11-07 19:33:16,093 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2024-11-07 19:33:16,093 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 68 flow [2024-11-07 19:33:16,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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:33:16,094 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:16,094 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 19:33:16,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 19:33:16,094 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:33:16,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:16,094 INFO L85 PathProgramCache]: Analyzing trace with hash 644602333, now seen corresponding path program 1 times [2024-11-07 19:33:16,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:33:16,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185844650] [2024-11-07 19:33:16,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:16,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:33:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:16,168 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:33:16,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:33:16,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185844650] [2024-11-07 19:33:16,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185844650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:33:16,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:33:16,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:33:16,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447983297] [2024-11-07 19:33:16,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:33:16,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:33:16,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:33:16,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:33:16,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:33:16,185 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-07 19:33:16,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 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:33:16,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:16,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-07 19:33:16,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:16,285 INFO L124 PetriNetUnfolderBase]: 113/239 cut-off events. [2024-11-07 19:33:16,285 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 19:33:16,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 466 conditions, 239 events. 113/239 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 931 event pairs, 72 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 289. Up to 136 conditions per place. [2024-11-07 19:33:16,287 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 38 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2024-11-07 19:33:16,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 49 transitions, 199 flow [2024-11-07 19:33:16,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:33:16,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:33:16,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2024-11-07 19:33:16,288 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6228571428571429 [2024-11-07 19:33:16,288 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 68 flow. Second operand 5 states and 109 transitions. [2024-11-07 19:33:16,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 49 transitions, 199 flow [2024-11-07 19:33:16,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 49 transitions, 195 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:33:16,290 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 89 flow [2024-11-07 19:33:16,290 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=89, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2024-11-07 19:33:16,290 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2024-11-07 19:33:16,290 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 89 flow [2024-11-07 19:33:16,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 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:33:16,291 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:16,291 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:33:16,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 19:33:16,291 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:33:16,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:16,292 INFO L85 PathProgramCache]: Analyzing trace with hash 978870344, now seen corresponding path program 1 times [2024-11-07 19:33:16,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:33:16,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411356497] [2024-11-07 19:33:16,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:16,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:33:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:16,357 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:33:16,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:33:16,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411356497] [2024-11-07 19:33:16,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411356497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:33:16,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:33:16,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:33:16,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077182743] [2024-11-07 19:33:16,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:33:16,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:33:16,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:33:16,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:33:16,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:33:16,372 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-07 19:33:16,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 89 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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:33:16,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:16,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-07 19:33:16,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:16,449 INFO L124 PetriNetUnfolderBase]: 97/211 cut-off events. [2024-11-07 19:33:16,449 INFO L125 PetriNetUnfolderBase]: For 65/74 co-relation queries the response was YES. [2024-11-07 19:33:16,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 211 events. 97/211 cut-off events. For 65/74 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 775 event pairs, 67 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 319. Up to 134 conditions per place. [2024-11-07 19:33:16,451 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 33 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2024-11-07 19:33:16,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 44 transitions, 204 flow [2024-11-07 19:33:16,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:33:16,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:33:16,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2024-11-07 19:33:16,452 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5942857142857143 [2024-11-07 19:33:16,453 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 89 flow. Second operand 5 states and 104 transitions. [2024-11-07 19:33:16,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 44 transitions, 204 flow [2024-11-07 19:33:16,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 44 transitions, 199 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:33:16,454 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 109 flow [2024-11-07 19:33:16,454 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2024-11-07 19:33:16,455 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2024-11-07 19:33:16,455 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 109 flow [2024-11-07 19:33:16,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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:33:16,455 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:16,455 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:33:16,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 19:33:16,456 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:33:16,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:16,456 INFO L85 PathProgramCache]: Analyzing trace with hash -867315661, now seen corresponding path program 1 times [2024-11-07 19:33:16,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:33:16,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044275767] [2024-11-07 19:33:16,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:16,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:33:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:16,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:33:16,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:33:16,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044275767] [2024-11-07 19:33:16,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044275767] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:33:16,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368685418] [2024-11-07 19:33:16,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:16,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:33:16,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:33:16,592 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:33:16,594 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:33:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:16,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 19:33:16,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:33:16,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:33:16,745 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:33:16,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 18 [2024-11-07 19:33:16,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:33:16,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368685418] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:33:16,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 19:33:16,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-07 19:33:16,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414684432] [2024-11-07 19:33:16,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 19:33:16,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 19:33:16,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:33:16,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 19:33:16,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-07 19:33:16,914 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-07 19:33:16,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 109 flow. Second operand has 11 states, 11 states have (on average 14.454545454545455) internal successors, (159), 11 states have internal predecessors, (159), 0 states have call successors, (0), 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:33:16,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:16,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-07 19:33:16,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:17,164 INFO L124 PetriNetUnfolderBase]: 136/293 cut-off events. [2024-11-07 19:33:17,164 INFO L125 PetriNetUnfolderBase]: For 111/124 co-relation queries the response was YES. [2024-11-07 19:33:17,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 293 events. 136/293 cut-off events. For 111/124 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1187 event pairs, 64 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 514. Up to 118 conditions per place. [2024-11-07 19:33:17,169 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 42 selfloop transitions, 9 changer transitions 0/57 dead transitions. [2024-11-07 19:33:17,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 57 transitions, 275 flow [2024-11-07 19:33:17,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 19:33:17,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-07 19:33:17,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2024-11-07 19:33:17,171 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5836734693877551 [2024-11-07 19:33:17,171 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 109 flow. Second operand 7 states and 143 transitions. [2024-11-07 19:33:17,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 57 transitions, 275 flow [2024-11-07 19:33:17,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 57 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:33:17,173 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 145 flow [2024-11-07 19:33:17,174 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=145, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2024-11-07 19:33:17,175 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2024-11-07 19:33:17,175 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 145 flow [2024-11-07 19:33:17,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.454545454545455) internal successors, (159), 11 states have internal predecessors, (159), 0 states have call successors, (0), 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:33:17,175 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:17,175 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:33:17,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 19:33:17,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:33:17,376 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:33:17,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:17,376 INFO L85 PathProgramCache]: Analyzing trace with hash -275375842, now seen corresponding path program 1 times [2024-11-07 19:33:17,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:33:17,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993588530] [2024-11-07 19:33:17,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:17,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:33:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:17,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:33:17,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:33:17,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993588530] [2024-11-07 19:33:17,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993588530] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:33:17,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665771623] [2024-11-07 19:33:17,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:17,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:33:17,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:33:17,526 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:33:17,527 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:33:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:17,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 19:33:17,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:33:17,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:33:17,684 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:33:17,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 18 [2024-11-07 19:33:17,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:33:17,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665771623] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:33:17,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 19:33:17,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-07 19:33:17,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143842591] [2024-11-07 19:33:17,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 19:33:17,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 19:33:17,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:33:17,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 19:33:17,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-07 19:33:17,864 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-07 19:33:17,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 145 flow. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 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:33:17,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:17,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-07 19:33:17,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:18,073 INFO L124 PetriNetUnfolderBase]: 198/395 cut-off events. [2024-11-07 19:33:18,074 INFO L125 PetriNetUnfolderBase]: For 525/574 co-relation queries the response was YES. [2024-11-07 19:33:18,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1109 conditions, 395 events. 198/395 cut-off events. For 525/574 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1637 event pairs, 88 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 911. Up to 179 conditions per place. [2024-11-07 19:33:18,077 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 49 selfloop transitions, 9 changer transitions 0/64 dead transitions. [2024-11-07 19:33:18,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 64 transitions, 381 flow [2024-11-07 19:33:18,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 19:33:18,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-07 19:33:18,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2024-11-07 19:33:18,079 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5755102040816327 [2024-11-07 19:33:18,079 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 145 flow. Second operand 7 states and 141 transitions. [2024-11-07 19:33:18,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 64 transitions, 381 flow [2024-11-07 19:33:18,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 64 transitions, 365 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-07 19:33:18,085 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 174 flow [2024-11-07 19:33:18,085 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-11-07 19:33:18,086 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2024-11-07 19:33:18,087 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 174 flow [2024-11-07 19:33:18,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 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:33:18,088 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:18,088 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:33:18,105 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:33:18,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:33:18,289 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:33:18,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:18,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1418714776, now seen corresponding path program 1 times [2024-11-07 19:33:18,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:33:18,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021453965] [2024-11-07 19:33:18,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:18,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:33:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:18,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:33:18,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:33:18,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021453965] [2024-11-07 19:33:18,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021453965] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:33:18,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842318370] [2024-11-07 19:33:18,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:18,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:33:18,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:33:18,377 INFO L229 MonitoredProcess]: Starting monitored process 5 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:33:18,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 19:33:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:18,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 19:33:18,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:33:18,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:33:18,519 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:33:18,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:33:18,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842318370] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:33:18,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 19:33:18,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-07 19:33:18,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694832554] [2024-11-07 19:33:18,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 19:33:18,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 19:33:18,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:33:18,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 19:33:18,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-07 19:33:18,629 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-07 19:33:18,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 174 flow. Second operand has 14 states, 14 states have (on average 14.928571428571429) internal successors, (209), 14 states have internal predecessors, (209), 0 states have call successors, (0), 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:33:18,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:18,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-07 19:33:18,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:18,903 INFO L124 PetriNetUnfolderBase]: 361/745 cut-off events. [2024-11-07 19:33:18,903 INFO L125 PetriNetUnfolderBase]: For 994/1028 co-relation queries the response was YES. [2024-11-07 19:33:18,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2296 conditions, 745 events. 361/745 cut-off events. For 994/1028 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3643 event pairs, 182 based on Foata normal form. 14/754 useless extension candidates. Maximal degree in co-relation 1208. Up to 322 conditions per place. [2024-11-07 19:33:18,910 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 65 selfloop transitions, 13 changer transitions 0/84 dead transitions. [2024-11-07 19:33:18,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 84 transitions, 546 flow [2024-11-07 19:33:18,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 19:33:18,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 19:33:18,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions. [2024-11-07 19:33:18,911 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5785714285714286 [2024-11-07 19:33:18,911 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 174 flow. Second operand 8 states and 162 transitions. [2024-11-07 19:33:18,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 84 transitions, 546 flow [2024-11-07 19:33:18,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 84 transitions, 525 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-07 19:33:18,917 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 260 flow [2024-11-07 19:33:18,917 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=260, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2024-11-07 19:33:18,918 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2024-11-07 19:33:18,919 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 260 flow [2024-11-07 19:33:18,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 14.928571428571429) internal successors, (209), 14 states have internal predecessors, (209), 0 states have call successors, (0), 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:33:18,920 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:18,920 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:33:18,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 19:33:19,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-07 19:33:19,125 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:33:19,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:19,125 INFO L85 PathProgramCache]: Analyzing trace with hash -430698513, now seen corresponding path program 1 times [2024-11-07 19:33:19,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:33:19,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518597379] [2024-11-07 19:33:19,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:19,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:33:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:19,149 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:33:19,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:33:19,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518597379] [2024-11-07 19:33:19,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518597379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:33:19,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:33:19,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:33:19,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074013477] [2024-11-07 19:33:19,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:33:19,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:33:19,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:33:19,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:33:19,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:33:19,152 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-07 19:33:19,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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:33:19,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:19,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-07 19:33:19,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:19,275 INFO L124 PetriNetUnfolderBase]: 479/930 cut-off events. [2024-11-07 19:33:19,275 INFO L125 PetriNetUnfolderBase]: For 1860/1941 co-relation queries the response was YES. [2024-11-07 19:33:19,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3106 conditions, 930 events. 479/930 cut-off events. For 1860/1941 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4602 event pairs, 138 based on Foata normal form. 3/930 useless extension candidates. Maximal degree in co-relation 1596. Up to 597 conditions per place. [2024-11-07 19:33:19,282 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 47 selfloop transitions, 3 changer transitions 6/61 dead transitions. [2024-11-07 19:33:19,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 61 transitions, 451 flow [2024-11-07 19:33:19,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:33:19,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:33:19,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-11-07 19:33:19,283 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6761904761904762 [2024-11-07 19:33:19,283 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 260 flow. Second operand 3 states and 71 transitions. [2024-11-07 19:33:19,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 61 transitions, 451 flow [2024-11-07 19:33:19,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 61 transitions, 444 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-07 19:33:19,288 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 237 flow [2024-11-07 19:33:19,288 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=237, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2024-11-07 19:33:19,289 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 23 predicate places. [2024-11-07 19:33:19,289 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 237 flow [2024-11-07 19:33:19,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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:33:19,289 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:19,289 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:33:19,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 19:33:19,289 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:33:19,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:19,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1754825725, now seen corresponding path program 1 times [2024-11-07 19:33:19,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:33:19,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519936307] [2024-11-07 19:33:19,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:19,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:33:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:19,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:33:19,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:33:19,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519936307] [2024-11-07 19:33:19,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519936307] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:33:19,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270187597] [2024-11-07 19:33:19,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:19,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:33:19,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:33:19,418 INFO L229 MonitoredProcess]: Starting monitored process 6 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:33:19,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 19:33:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:19,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 19:33:19,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:33:19,547 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:33:19,547 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:33:19,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:33:19,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270187597] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:33:19,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 19:33:19,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-07 19:33:19,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366986547] [2024-11-07 19:33:19,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 19:33:19,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 19:33:19,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:33:19,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 19:33:19,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-07 19:33:19,665 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-07 19:33:19,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 237 flow. Second operand has 14 states, 14 states have (on average 15.071428571428571) internal successors, (211), 14 states have internal predecessors, (211), 0 states have call successors, (0), 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:33:19,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:19,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-07 19:33:19,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:19,853 INFO L124 PetriNetUnfolderBase]: 356/689 cut-off events. [2024-11-07 19:33:19,853 INFO L125 PetriNetUnfolderBase]: For 1735/1834 co-relation queries the response was YES. [2024-11-07 19:33:19,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2420 conditions, 689 events. 356/689 cut-off events. For 1735/1834 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3350 event pairs, 209 based on Foata normal form. 13/690 useless extension candidates. Maximal degree in co-relation 1459. Up to 375 conditions per place. [2024-11-07 19:33:19,859 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 53 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2024-11-07 19:33:19,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 71 transitions, 515 flow [2024-11-07 19:33:19,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 19:33:19,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 19:33:19,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-11-07 19:33:19,861 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5678571428571428 [2024-11-07 19:33:19,862 INFO L175 Difference]: Start difference. First operand has 59 places, 43 transitions, 237 flow. Second operand 8 states and 159 transitions. [2024-11-07 19:33:19,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 71 transitions, 515 flow [2024-11-07 19:33:19,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 71 transitions, 488 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-11-07 19:33:19,867 INFO L231 Difference]: Finished difference. Result has 62 places, 47 transitions, 281 flow [2024-11-07 19:33:19,867 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=281, PETRI_PLACES=62, PETRI_TRANSITIONS=47} [2024-11-07 19:33:19,867 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 26 predicate places. [2024-11-07 19:33:19,867 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 281 flow [2024-11-07 19:33:19,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.071428571428571) internal successors, (211), 14 states have internal predecessors, (211), 0 states have call successors, (0), 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:33:19,868 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:19,868 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:33:19,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 19:33:20,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-07 19:33:20,069 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:33:20,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:20,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1341733998, now seen corresponding path program 2 times [2024-11-07 19:33:20,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:33:20,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927436229] [2024-11-07 19:33:20,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:20,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:33:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:20,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:33:20,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:33:20,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927436229] [2024-11-07 19:33:20,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927436229] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:33:20,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048296578] [2024-11-07 19:33:20,265 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 19:33:20,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:33:20,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:33:20,268 INFO L229 MonitoredProcess]: Starting monitored process 7 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:33:20,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-07 19:33:20,333 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 19:33:20,334 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:33:20,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 19:33:20,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:33:20,458 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:33:20,459 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:33:20,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 20 [2024-11-07 19:33:20,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:33:20,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048296578] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:33:20,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 19:33:20,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2024-11-07 19:33:20,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916256845] [2024-11-07 19:33:20,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 19:33:20,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-07 19:33:20,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:33:20,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-07 19:33:20,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-07 19:33:20,889 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-07 19:33:20,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 47 transitions, 281 flow. Second operand has 20 states, 20 states have (on average 14.65) internal successors, (293), 20 states have internal predecessors, (293), 0 states have call successors, (0), 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:33:20,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:20,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-07 19:33:20,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:21,337 INFO L124 PetriNetUnfolderBase]: 383/785 cut-off events. [2024-11-07 19:33:21,337 INFO L125 PetriNetUnfolderBase]: For 1845/1866 co-relation queries the response was YES. [2024-11-07 19:33:21,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2710 conditions, 785 events. 383/785 cut-off events. For 1845/1866 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3960 event pairs, 148 based on Foata normal form. 14/779 useless extension candidates. Maximal degree in co-relation 1778. Up to 215 conditions per place. [2024-11-07 19:33:21,343 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 75 selfloop transitions, 14 changer transitions 0/97 dead transitions. [2024-11-07 19:33:21,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 97 transitions, 705 flow [2024-11-07 19:33:21,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 19:33:21,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-07 19:33:21,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions. [2024-11-07 19:33:21,345 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5857142857142857 [2024-11-07 19:33:21,345 INFO L175 Difference]: Start difference. First operand has 62 places, 47 transitions, 281 flow. Second operand 10 states and 205 transitions. [2024-11-07 19:33:21,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 97 transitions, 705 flow [2024-11-07 19:33:21,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 97 transitions, 690 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-07 19:33:21,352 INFO L231 Difference]: Finished difference. Result has 70 places, 51 transitions, 338 flow [2024-11-07 19:33:21,353 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=338, PETRI_PLACES=70, PETRI_TRANSITIONS=51} [2024-11-07 19:33:21,353 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 34 predicate places. [2024-11-07 19:33:21,355 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 51 transitions, 338 flow [2024-11-07 19:33:21,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 14.65) internal successors, (293), 20 states have internal predecessors, (293), 0 states have call successors, (0), 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:33:21,355 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:21,355 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:33:21,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-07 19:33:21,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-07 19:33:21,556 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:33:21,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:21,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1576057945, now seen corresponding path program 2 times [2024-11-07 19:33:21,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:33:21,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063243989] [2024-11-07 19:33:21,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:21,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:33:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:21,813 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:33:21,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:33:21,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063243989] [2024-11-07 19:33:21,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063243989] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:33:21,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830390908] [2024-11-07 19:33:21,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 19:33:21,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:33:21,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:33:21,816 INFO L229 MonitoredProcess]: Starting monitored process 8 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:33:21,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-07 19:33:21,882 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 19:33:21,883 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:33:21,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 19:33:21,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:33:22,009 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:33:22,010 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:33:22,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 20 [2024-11-07 19:33:22,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:33:22,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830390908] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:33:22,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 19:33:22,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2024-11-07 19:33:22,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278956480] [2024-11-07 19:33:22,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 19:33:22,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-07 19:33:22,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:33:22,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-07 19:33:22,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-07 19:33:22,420 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-07 19:33:22,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 51 transitions, 338 flow. Second operand has 20 states, 20 states have (on average 14.95) internal successors, (299), 20 states have internal predecessors, (299), 0 states have call successors, (0), 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:33:22,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:22,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-07 19:33:22,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:22,849 INFO L124 PetriNetUnfolderBase]: 478/945 cut-off events. [2024-11-07 19:33:22,850 INFO L125 PetriNetUnfolderBase]: For 3382/3452 co-relation queries the response was YES. [2024-11-07 19:33:22,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3554 conditions, 945 events. 478/945 cut-off events. For 3382/3452 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4701 event pairs, 193 based on Foata normal form. 19/942 useless extension candidates. Maximal degree in co-relation 2599. Up to 292 conditions per place. [2024-11-07 19:33:22,858 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 83 selfloop transitions, 14 changer transitions 0/105 dead transitions. [2024-11-07 19:33:22,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 105 transitions, 905 flow [2024-11-07 19:33:22,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 19:33:22,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-07 19:33:22,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 201 transitions. [2024-11-07 19:33:22,859 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5742857142857143 [2024-11-07 19:33:22,860 INFO L175 Difference]: Start difference. First operand has 70 places, 51 transitions, 338 flow. Second operand 10 states and 201 transitions. [2024-11-07 19:33:22,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 105 transitions, 905 flow [2024-11-07 19:33:22,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 105 transitions, 832 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-11-07 19:33:22,867 INFO L231 Difference]: Finished difference. Result has 76 places, 55 transitions, 377 flow [2024-11-07 19:33:22,868 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=377, PETRI_PLACES=76, PETRI_TRANSITIONS=55} [2024-11-07 19:33:22,868 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 40 predicate places. [2024-11-07 19:33:22,868 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 55 transitions, 377 flow [2024-11-07 19:33:22,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 14.95) internal successors, (299), 20 states have internal predecessors, (299), 0 states have call successors, (0), 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:33:22,869 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:22,869 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-07 19:33:22,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-07 19:33:23,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:33:23,070 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:33:23,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:23,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1788589, now seen corresponding path program 3 times [2024-11-07 19:33:23,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:33:23,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367703022] [2024-11-07 19:33:23,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:23,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:33:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:23,208 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:33:23,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:33:23,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367703022] [2024-11-07 19:33:23,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367703022] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:33:23,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245840876] [2024-11-07 19:33:23,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 19:33:23,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:33:23,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:33:23,211 INFO L229 MonitoredProcess]: Starting monitored process 9 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:33:23,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-07 19:33:23,272 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-07 19:33:23,273 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:33:23,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 19:33:23,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:33:23,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-07 19:33:23,392 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 19:33:23,392 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:33:23,605 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 19:33:23,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245840876] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:33:23,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 19:33:23,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 20 [2024-11-07 19:33:23,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965206153] [2024-11-07 19:33:23,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 19:33:23,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-07 19:33:23,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:33:23,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-07 19:33:23,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2024-11-07 19:33:23,875 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-07 19:33:23,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 55 transitions, 377 flow. Second operand has 21 states, 21 states have (on average 14.095238095238095) internal successors, (296), 21 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:33:23,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:23,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-07 19:33:23,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:24,559 INFO L124 PetriNetUnfolderBase]: 917/1728 cut-off events. [2024-11-07 19:33:24,559 INFO L125 PetriNetUnfolderBase]: For 6272/6354 co-relation queries the response was YES. [2024-11-07 19:33:24,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6769 conditions, 1728 events. 917/1728 cut-off events. For 6272/6354 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 9487 event pairs, 213 based on Foata normal form. 36/1740 useless extension candidates. Maximal degree in co-relation 3763. Up to 261 conditions per place. [2024-11-07 19:33:24,575 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 170 selfloop transitions, 27 changer transitions 0/204 dead transitions. [2024-11-07 19:33:24,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 204 transitions, 1877 flow [2024-11-07 19:33:24,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 19:33:24,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-07 19:33:24,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 303 transitions. [2024-11-07 19:33:24,578 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5410714285714285 [2024-11-07 19:33:24,578 INFO L175 Difference]: Start difference. First operand has 76 places, 55 transitions, 377 flow. Second operand 16 states and 303 transitions. [2024-11-07 19:33:24,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 204 transitions, 1877 flow [2024-11-07 19:33:24,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 204 transitions, 1722 flow, removed 40 selfloop flow, removed 6 redundant places. [2024-11-07 19:33:24,591 INFO L231 Difference]: Finished difference. Result has 90 places, 65 transitions, 520 flow [2024-11-07 19:33:24,591 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=520, PETRI_PLACES=90, PETRI_TRANSITIONS=65} [2024-11-07 19:33:24,591 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 54 predicate places. [2024-11-07 19:33:24,592 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 65 transitions, 520 flow [2024-11-07 19:33:24,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 14.095238095238095) internal successors, (296), 21 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:33:24,592 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:24,592 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:33:24,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-07 19:33:24,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:33:24,794 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:33:24,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:24,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1157106110, now seen corresponding path program 3 times [2024-11-07 19:33:24,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:33:24,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481283479] [2024-11-07 19:33:24,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:24,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:33:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:24,933 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:33:24,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:33:24,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481283479] [2024-11-07 19:33:24,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481283479] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:33:24,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016987221] [2024-11-07 19:33:24,934 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 19:33:24,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:33:24,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:33:24,936 INFO L229 MonitoredProcess]: Starting monitored process 10 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:33:24,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-07 19:33:25,002 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-07 19:33:25,003 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:33:25,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 19:33:25,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:33:25,126 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 19:33:25,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:33:25,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 11 [2024-11-07 19:33:25,335 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 19:33:25,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016987221] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:33:25,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 19:33:25,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 19 [2024-11-07 19:33:25,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481445440] [2024-11-07 19:33:25,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 19:33:25,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-07 19:33:25,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:33:25,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-07 19:33:25,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2024-11-07 19:33:25,603 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-07 19:33:25,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 65 transitions, 520 flow. Second operand has 20 states, 20 states have (on average 14.35) internal successors, (287), 20 states have internal predecessors, (287), 0 states have call successors, (0), 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:33:25,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:25,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-07 19:33:25,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:26,191 INFO L124 PetriNetUnfolderBase]: 839/1535 cut-off events. [2024-11-07 19:33:26,192 INFO L125 PetriNetUnfolderBase]: For 7705/7762 co-relation queries the response was YES. [2024-11-07 19:33:26,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6570 conditions, 1535 events. 839/1535 cut-off events. For 7705/7762 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 8048 event pairs, 223 based on Foata normal form. 36/1546 useless extension candidates. Maximal degree in co-relation 3652. Up to 277 conditions per place. [2024-11-07 19:33:26,206 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 150 selfloop transitions, 27 changer transitions 0/185 dead transitions. [2024-11-07 19:33:26,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 185 transitions, 1911 flow [2024-11-07 19:33:26,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 19:33:26,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-07 19:33:26,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 295 transitions. [2024-11-07 19:33:26,211 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5267857142857143 [2024-11-07 19:33:26,211 INFO L175 Difference]: Start difference. First operand has 90 places, 65 transitions, 520 flow. Second operand 16 states and 295 transitions. [2024-11-07 19:33:26,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 185 transitions, 1911 flow [2024-11-07 19:33:26,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 185 transitions, 1770 flow, removed 45 selfloop flow, removed 5 redundant places. [2024-11-07 19:33:26,223 INFO L231 Difference]: Finished difference. Result has 104 places, 73 transitions, 631 flow [2024-11-07 19:33:26,224 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=631, PETRI_PLACES=104, PETRI_TRANSITIONS=73} [2024-11-07 19:33:26,224 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 68 predicate places. [2024-11-07 19:33:26,224 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 73 transitions, 631 flow [2024-11-07 19:33:26,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 14.35) internal successors, (287), 20 states have internal predecessors, (287), 0 states have call successors, (0), 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:33:26,224 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:26,225 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] [2024-11-07 19:33:26,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-07 19:33:26,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:33:26,429 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:33:26,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:26,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1622538570, now seen corresponding path program 1 times [2024-11-07 19:33:26,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:33:26,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503411702] [2024-11-07 19:33:26,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:26,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:33:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:26,514 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:33:26,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:33:26,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503411702] [2024-11-07 19:33:26,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503411702] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:33:26,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333341135] [2024-11-07 19:33:26,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:26,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:33:26,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:33:26,517 INFO L229 MonitoredProcess]: Starting monitored process 11 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:33:26,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-07 19:33:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:26,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 19:33:26,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:33:26,617 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:33:26,617 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:33:26,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:33:26,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333341135] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 19:33:26,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-07 19:33:26,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 10 [2024-11-07 19:33:26,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484343551] [2024-11-07 19:33:26,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:33:26,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:33:26,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:33:26,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:33:26,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-07 19:33:26,664 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-07 19:33:26,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 73 transitions, 631 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 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:33:26,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:26,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-07 19:33:26,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:26,819 INFO L124 PetriNetUnfolderBase]: 775/1465 cut-off events. [2024-11-07 19:33:26,820 INFO L125 PetriNetUnfolderBase]: For 8508/8523 co-relation queries the response was YES. [2024-11-07 19:33:26,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6592 conditions, 1465 events. 775/1465 cut-off events. For 8508/8523 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 7774 event pairs, 241 based on Foata normal form. 52/1496 useless extension candidates. Maximal degree in co-relation 4061. Up to 677 conditions per place. [2024-11-07 19:33:26,832 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 73 selfloop transitions, 13 changer transitions 0/94 dead transitions. [2024-11-07 19:33:26,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 94 transitions, 982 flow [2024-11-07 19:33:26,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:33:26,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:33:26,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2024-11-07 19:33:26,833 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5371428571428571 [2024-11-07 19:33:26,833 INFO L175 Difference]: Start difference. First operand has 104 places, 73 transitions, 631 flow. Second operand 5 states and 94 transitions. [2024-11-07 19:33:26,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 94 transitions, 982 flow [2024-11-07 19:33:26,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 94 transitions, 935 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-11-07 19:33:26,845 INFO L231 Difference]: Finished difference. Result has 100 places, 70 transitions, 577 flow [2024-11-07 19:33:26,845 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=577, PETRI_PLACES=100, PETRI_TRANSITIONS=70} [2024-11-07 19:33:26,846 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 64 predicate places. [2024-11-07 19:33:26,846 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 70 transitions, 577 flow [2024-11-07 19:33:26,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 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:33:26,846 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:26,846 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] [2024-11-07 19:33:26,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-07 19:33:27,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-07 19:33:27,051 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:33:27,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:27,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1592560192, now seen corresponding path program 1 times [2024-11-07 19:33:27,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:33:27,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100956240] [2024-11-07 19:33:27,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:27,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:33:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:27,123 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:33:27,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:33:27,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100956240] [2024-11-07 19:33:27,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100956240] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:33:27,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074176360] [2024-11-07 19:33:27,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:27,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:33:27,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:33:27,126 INFO L229 MonitoredProcess]: Starting monitored process 12 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:33:27,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-07 19:33:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:27,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 19:33:27,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:33:27,218 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:33:27,218 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:33:27,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:33:27,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074176360] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 19:33:27,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-07 19:33:27,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2024-11-07 19:33:27,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482640582] [2024-11-07 19:33:27,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:33:27,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:33:27,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:33:27,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:33:27,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-07 19:33:27,265 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-07 19:33:27,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 70 transitions, 577 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 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:33:27,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:27,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-07 19:33:27,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:27,404 INFO L124 PetriNetUnfolderBase]: 718/1360 cut-off events. [2024-11-07 19:33:27,404 INFO L125 PetriNetUnfolderBase]: For 8292/8299 co-relation queries the response was YES. [2024-11-07 19:33:27,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5973 conditions, 1360 events. 718/1360 cut-off events. For 8292/8299 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 7270 event pairs, 193 based on Foata normal form. 46/1363 useless extension candidates. Maximal degree in co-relation 4648. Up to 653 conditions per place. [2024-11-07 19:33:27,431 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 68 selfloop transitions, 13 changer transitions 0/89 dead transitions. [2024-11-07 19:33:27,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 89 transitions, 905 flow [2024-11-07 19:33:27,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:33:27,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:33:27,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2024-11-07 19:33:27,434 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-11-07 19:33:27,434 INFO L175 Difference]: Start difference. First operand has 100 places, 70 transitions, 577 flow. Second operand 5 states and 95 transitions. [2024-11-07 19:33:27,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 89 transitions, 905 flow [2024-11-07 19:33:27,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 89 transitions, 853 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-11-07 19:33:27,444 INFO L231 Difference]: Finished difference. Result has 98 places, 67 transitions, 539 flow [2024-11-07 19:33:27,444 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=539, PETRI_PLACES=98, PETRI_TRANSITIONS=67} [2024-11-07 19:33:27,444 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 62 predicate places. [2024-11-07 19:33:27,444 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 67 transitions, 539 flow [2024-11-07 19:33:27,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 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:33:27,444 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:27,444 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:33:27,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-07 19:33:27,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-07 19:33:27,645 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:33:27,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:27,645 INFO L85 PathProgramCache]: Analyzing trace with hash -2095331061, now seen corresponding path program 1 times [2024-11-07 19:33:27,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:33:27,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295436665] [2024-11-07 19:33:27,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:27,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:33:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:27,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:33:27,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:33:27,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295436665] [2024-11-07 19:33:27,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295436665] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:33:27,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301990864] [2024-11-07 19:33:27,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:27,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:33:27,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:33:27,924 INFO L229 MonitoredProcess]: Starting monitored process 13 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:33:27,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-07 19:33:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:27,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-07 19:33:27,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:33:28,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:33:28,098 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:33:28,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:33:28,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2024-11-07 19:33:28,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:33:28,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301990864] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:33:28,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 19:33:28,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2024-11-07 19:33:28,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673487426] [2024-11-07 19:33:28,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 19:33:28,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 19:33:28,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:33:28,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 19:33:28,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2024-11-07 19:33:28,345 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-07 19:33:28,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 67 transitions, 539 flow. Second operand has 18 states, 18 states have (on average 14.11111111111111) internal successors, (254), 18 states have internal predecessors, (254), 0 states have call successors, (0), 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:33:28,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:28,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-07 19:33:28,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:29,012 INFO L124 PetriNetUnfolderBase]: 1437/2703 cut-off events. [2024-11-07 19:33:29,013 INFO L125 PetriNetUnfolderBase]: For 13459/13496 co-relation queries the response was YES. [2024-11-07 19:33:29,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11491 conditions, 2703 events. 1437/2703 cut-off events. For 13459/13496 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 16115 event pairs, 176 based on Foata normal form. 5/2705 useless extension candidates. Maximal degree in co-relation 8625. Up to 1215 conditions per place. [2024-11-07 19:33:29,029 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 183 selfloop transitions, 79 changer transitions 17/286 dead transitions. [2024-11-07 19:33:29,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 286 transitions, 2784 flow [2024-11-07 19:33:29,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-07 19:33:29,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-07 19:33:29,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 398 transitions. [2024-11-07 19:33:29,031 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5414965986394558 [2024-11-07 19:33:29,031 INFO L175 Difference]: Start difference. First operand has 98 places, 67 transitions, 539 flow. Second operand 21 states and 398 transitions. [2024-11-07 19:33:29,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 286 transitions, 2784 flow [2024-11-07 19:33:29,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 286 transitions, 2692 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 19:33:29,057 INFO L231 Difference]: Finished difference. Result has 122 places, 141 transitions, 1350 flow [2024-11-07 19:33:29,057 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1350, PETRI_PLACES=122, PETRI_TRANSITIONS=141} [2024-11-07 19:33:29,058 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 86 predicate places. [2024-11-07 19:33:29,059 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 141 transitions, 1350 flow [2024-11-07 19:33:29,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 14.11111111111111) internal successors, (254), 18 states have internal predecessors, (254), 0 states have call successors, (0), 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:33:29,059 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:29,059 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:33:29,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-07 19:33:29,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-07 19:33:29,265 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:33:29,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:29,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1561583633, now seen corresponding path program 2 times [2024-11-07 19:33:29,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:33:29,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343441970] [2024-11-07 19:33:29,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:29,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:33:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:33:29,277 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:33:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:33:29,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 19:33:29,333 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:33:29,334 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (13 of 14 remaining) [2024-11-07 19:33:29,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2024-11-07 19:33:29,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2024-11-07 19:33:29,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2024-11-07 19:33:29,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2024-11-07 19:33:29,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2024-11-07 19:33:29,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2024-11-07 19:33:29,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (6 of 14 remaining) [2024-11-07 19:33:29,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 14 remaining) [2024-11-07 19:33:29,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 14 remaining) [2024-11-07 19:33:29,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2024-11-07 19:33:29,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2024-11-07 19:33:29,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2024-11-07 19:33:29,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 14 remaining) [2024-11-07 19:33:29,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 19:33:29,344 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:33:29,392 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 19:33:29,393 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 19:33:29,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:33:29 BasicIcfg [2024-11-07 19:33:29,400 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 19:33:29,401 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 19:33:29,401 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 19:33:29,401 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 19:33:29,402 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:33:13" (3/4) ... [2024-11-07 19:33:29,403 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 19:33:29,404 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 19:33:29,405 INFO L158 Benchmark]: Toolchain (without parser) took 16807.10ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 92.4MB in the beginning and 148.5MB in the end (delta: -56.1MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2024-11-07 19:33:29,405 INFO L158 Benchmark]: CDTParser took 0.82ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:33:29,406 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.71ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 80.5MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 19:33:29,406 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.48ms. Allocated memory is still 117.4MB. Free memory was 80.5MB in the beginning and 79.0MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 19:33:29,406 INFO L158 Benchmark]: Boogie Preprocessor took 54.26ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 77.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:33:29,406 INFO L158 Benchmark]: RCFGBuilder took 696.71ms. Allocated memory is still 117.4MB. Free memory was 77.0MB in the beginning and 79.6MB in the end (delta: -2.6MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2024-11-07 19:33:29,407 INFO L158 Benchmark]: TraceAbstraction took 15737.52ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 79.2MB in the beginning and 148.5MB in the end (delta: -69.4MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. [2024-11-07 19:33:29,407 INFO L158 Benchmark]: Witness Printer took 3.14ms. Allocated memory is still 192.9MB. Free memory was 148.5MB in the beginning and 148.5MB in the end (delta: 45.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:33:29,409 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.82ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.71ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 80.5MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.48ms. Allocated memory is still 117.4MB. Free memory was 80.5MB in the beginning and 79.0MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.26ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 77.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 696.71ms. Allocated memory is still 117.4MB. Free memory was 77.0MB in the beginning and 79.6MB in the end (delta: -2.6MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. * TraceAbstraction took 15737.52ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 79.2MB in the beginning and 148.5MB in the end (delta: -69.4MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. * Witness Printer took 3.14ms. Allocated memory is still 192.9MB. Free memory was 148.5MB in the beginning and 148.5MB in the end (delta: 45.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 21]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 21. Possible FailurePath: [L39] 0 int* A; [L40] 0 _Atomic int counter; [L41] 0 int N; [L66] 0 pthread_t t1, t2; [L68] 0 N = __VERIFIER_nondet_int() [L69] CALL, EXPR 0 create_fresh_int_array(N) [L84] CALL 0 assume_abort_if_not(size >= 0) [L36] COND FALSE 0 !(!cond) [L84] RET 0 assume_abort_if_not(size >= 0) [L85] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L36] COND FALSE 0 !(!cond) [L85] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L87] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L88] 0 int i = 0; VAL [A={0:0}, N=1, \old(size)=1, arr={-2:0}, counter=0, i=0, size=1] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=1, \old(size)=1, arr={-2:0}, counter=0, i=1, size=1] [L88] COND FALSE 0 !(i < size) [L91] 0 return arr; [L69] RET, EXPR 0 create_fresh_int_array(N) [L69] 0 A = create_fresh_int_array(N) [L72] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={-2:0}, N=1, counter=0, t1=-1] [L73] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={-2:0}, N=1, counter=0, t1=-1, t2=0] [L48] 1 int i=0; VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L57] 2 int i=0; VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L59] 2 counter = tmp VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=-6, i=0, tmp=-6] [L57] 2 i++ VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=-6, i=1] [L57] COND FALSE 2 !(i 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 -> 387879bf92b16ead997b40b3e249348f8a6b399496756f9bc3c41b6dc3c21353 [2024-11-07 19:33:32,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:33:32,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:33:32,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:33:32,100 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:33:32,101 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:33:32,102 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2024-11-07 19:33:33,438 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:33:33,708 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:33:33,709 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2024-11-07 19:33:33,719 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5bbec79ae/4c563c220b6e4afdaeec683281d7a2cf/FLAG7898fed06 [2024-11-07 19:33:33,742 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5bbec79ae/4c563c220b6e4afdaeec683281d7a2cf [2024-11-07 19:33:33,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:33:33,746 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:33:33,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:33:33,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:33:33,754 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:33:33,757 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:33:33" (1/1) ... [2024-11-07 19:33:33,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56a718ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:33, skipping insertion in model container [2024-11-07 19:33:33,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:33:33" (1/1) ... [2024-11-07 19:33:33,773 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:33:33,941 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 19:33:33,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:33:33,967 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:33:33,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:33:34,012 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:33:34,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:34 WrapperNode [2024-11-07 19:33:34,013 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:33:34,014 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:33:34,015 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:33:34,015 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:33:34,021 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:33:34" (1/1) ... [2024-11-07 19:33:34,032 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:33:34" (1/1) ... [2024-11-07 19:33:34,058 INFO L138 Inliner]: procedures = 25, calls = 23, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 132 [2024-11-07 19:33:34,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:33:34,062 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:33:34,062 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:33:34,062 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:33:34,069 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:34" (1/1) ... [2024-11-07 19:33:34,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:34" (1/1) ... [2024-11-07 19:33:34,077 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:34" (1/1) ... [2024-11-07 19:33:34,098 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-07 19:33:34,098 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:34" (1/1) ... [2024-11-07 19:33:34,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:34" (1/1) ... [2024-11-07 19:33:34,113 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:34" (1/1) ... [2024-11-07 19:33:34,115 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:34" (1/1) ... [2024-11-07 19:33:34,116 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:34" (1/1) ... [2024-11-07 19:33:34,120 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:34" (1/1) ... [2024-11-07 19:33:34,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:33:34,126 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:33:34,126 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:33:34,126 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:33:34,127 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:34" (1/1) ... [2024-11-07 19:33:34,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:33:34,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:33:34,162 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:33:34,165 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:33:34,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:33:34,188 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-07 19:33:34,188 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-07 19:33:34,188 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-07 19:33:34,188 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-07 19:33:34,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 19:33:34,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 19:33:34,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 19:33:34,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 19:33:34,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 19:33:34,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:33:34,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:33:34,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 19:33:34,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 19:33:34,190 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:33:34,312 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:33:34,314 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:33:34,692 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 19:33:34,692 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:33:34,969 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:33:34,969 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-07 19:33:34,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:33:34 BoogieIcfgContainer [2024-11-07 19:33:34,970 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:33:34,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:33:34,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:33:34,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:33:34,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:33:33" (1/3) ... [2024-11-07 19:33:34,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5057a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:33:34, skipping insertion in model container [2024-11-07 19:33:34,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:34" (2/3) ... [2024-11-07 19:33:34,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5057a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:33:34, skipping insertion in model container [2024-11-07 19:33:34,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:33:34" (3/3) ... [2024-11-07 19:33:34,979 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2024-11-07 19:33:34,992 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:33:34,993 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-07 19:33:34,993 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 19:33:35,072 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-07 19:33:35,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 35 transitions, 84 flow [2024-11-07 19:33:35,137 INFO L124 PetriNetUnfolderBase]: 3/33 cut-off events. [2024-11-07 19:33:35,139 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 19:33:35,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 33 events. 3/33 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2024-11-07 19:33:35,144 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 35 transitions, 84 flow [2024-11-07 19:33:35,147 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 32 transitions, 76 flow [2024-11-07 19:33:35,156 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:33:35,168 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;@7eca0b71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:33:35,169 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-07 19:33:35,173 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:33:35,176 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-07 19:33:35,176 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:33:35,176 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:35,177 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-07 19:33:35,177 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:33:35,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:35,182 INFO L85 PathProgramCache]: Analyzing trace with hash 446122, now seen corresponding path program 1 times [2024-11-07 19:33:35,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:33:35,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [914888780] [2024-11-07 19:33:35,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:35,193 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:33:35,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:33:35,196 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:33:35,198 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:33:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:35,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:33:35,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:33:35,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-07 19:33:35,332 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:33:35,333 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:33:35,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:33:35,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [914888780] [2024-11-07 19:33:35,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [914888780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:33:35,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:33:35,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:33:35,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578580414] [2024-11-07 19:33:35,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:33:35,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:33:35,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:33:35,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:33:35,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:33:35,386 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-07 19:33:35,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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:33:35,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:35,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-07 19:33:35,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:35,514 INFO L124 PetriNetUnfolderBase]: 62/153 cut-off events. [2024-11-07 19:33:35,514 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-07 19:33:35,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 153 events. 62/153 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 603 event pairs, 42 based on Foata normal form. 1/140 useless extension candidates. Maximal degree in co-relation 240. Up to 109 conditions per place. [2024-11-07 19:33:35,517 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 17 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2024-11-07 19:33:35,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 108 flow [2024-11-07 19:33:35,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:33:35,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:33:35,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-11-07 19:33:35,528 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-11-07 19:33:35,529 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 76 flow. Second operand 3 states and 60 transitions. [2024-11-07 19:33:35,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 108 flow [2024-11-07 19:33:35,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 100 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 19:33:35,537 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 66 flow [2024-11-07 19:33:35,540 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2024-11-07 19:33:35,543 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2024-11-07 19:33:35,544 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 66 flow [2024-11-07 19:33:35,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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:33:35,545 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:35,545 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-07 19:33:35,549 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:33:35,748 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:33:35,748 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:33:35,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:35,749 INFO L85 PathProgramCache]: Analyzing trace with hash 446123, now seen corresponding path program 1 times [2024-11-07 19:33:35,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:33:35,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [362072128] [2024-11-07 19:33:35,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:35,749 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:33:35,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:33:35,752 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:33:35,754 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:33:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:35,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 19:33:35,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:33:35,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2024-11-07 19:33:35,951 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:33:35,951 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:33:35,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:33:35,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [362072128] [2024-11-07 19:33:35,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [362072128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:33:35,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:33:35,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:33:35,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494488771] [2024-11-07 19:33:35,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:33:35,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:33:35,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:33:35,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:33:35,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:33:35,990 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-07 19:33:35,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:35,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:35,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-07 19:33:35,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:36,189 INFO L124 PetriNetUnfolderBase]: 63/156 cut-off events. [2024-11-07 19:33:36,189 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-07 19:33:36,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 156 events. 63/156 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 617 event pairs, 42 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 260. Up to 114 conditions per place. [2024-11-07 19:33:36,190 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 19 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2024-11-07 19:33:36,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 120 flow [2024-11-07 19:33:36,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:33:36,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:33:36,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2024-11-07 19:33:36,192 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-11-07 19:33:36,192 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 66 flow. Second operand 4 states and 76 transitions. [2024-11-07 19:33:36,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 120 flow [2024-11-07 19:33:36,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:33:36,194 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 89 flow [2024-11-07 19:33:36,195 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=89, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2024-11-07 19:33:36,195 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2024-11-07 19:33:36,195 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 89 flow [2024-11-07 19:33:36,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:36,196 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:36,196 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-11-07 19:33:36,199 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 (3)] Ended with exit code 0 [2024-11-07 19:33:36,398 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:33:36,399 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:33:36,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:36,400 INFO L85 PathProgramCache]: Analyzing trace with hash 428737876, now seen corresponding path program 1 times [2024-11-07 19:33:36,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:33:36,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1701048628] [2024-11-07 19:33:36,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:36,401 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:33:36,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:33:36,403 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:33:36,404 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:33:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:36,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 19:33:36,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:33:36,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2024-11-07 19:33:36,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:33:36,659 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:33:36,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:33:36,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:33:36,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1701048628] [2024-11-07 19:33:36,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1701048628] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:33:36,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 19:33:36,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-11-07 19:33:36,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434608148] [2024-11-07 19:33:36,949 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 19:33:36,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 19:33:36,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:33:36,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 19:33:36,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-07 19:33:37,175 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-07 19:33:37,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 89 flow. Second operand has 10 states, 10 states have (on average 14.0) internal successors, (140), 10 states have internal predecessors, (140), 0 states have call successors, (0), 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:33:37,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:37,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-07 19:33:37,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:37,595 INFO L124 PetriNetUnfolderBase]: 66/165 cut-off events. [2024-11-07 19:33:37,596 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-07 19:33:37,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 165 events. 66/165 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 677 event pairs, 42 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 267. Up to 117 conditions per place. [2024-11-07 19:33:37,597 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 19 selfloop transitions, 13 changer transitions 0/41 dead transitions. [2024-11-07 19:33:37,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 189 flow [2024-11-07 19:33:37,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 19:33:37,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-07 19:33:37,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2024-11-07 19:33:37,601 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-11-07 19:33:37,601 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 89 flow. Second operand 10 states and 165 transitions. [2024-11-07 19:33:37,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 189 flow [2024-11-07 19:33:37,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 186 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:33:37,602 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 166 flow [2024-11-07 19:33:37,603 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=166, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2024-11-07 19:33:37,604 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2024-11-07 19:33:37,605 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 166 flow [2024-11-07 19:33:37,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.0) internal successors, (140), 10 states have internal predecessors, (140), 0 states have call successors, (0), 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:33:37,605 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:37,605 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 19:33:37,608 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:33:37,807 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:33:37,808 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:33:37,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:37,809 INFO L85 PathProgramCache]: Analyzing trace with hash 407994266, now seen corresponding path program 1 times [2024-11-07 19:33:37,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:33:37,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [835017548] [2024-11-07 19:33:37,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:37,809 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:33:37,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:33:37,811 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:33:37,812 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:33:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:37,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 19:33:37,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:33:37,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-07 19:33:37,890 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:33:37,890 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:33:37,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:33:37,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [835017548] [2024-11-07 19:33:37,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [835017548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:33:37,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:33:37,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:33:37,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431834582] [2024-11-07 19:33:37,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:33:37,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:33:37,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:33:37,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:33:37,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:33:37,924 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-07 19:33:37,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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:33:37,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:37,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-07 19:33:37,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:38,021 INFO L124 PetriNetUnfolderBase]: 66/155 cut-off events. [2024-11-07 19:33:38,021 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-07 19:33:38,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 155 events. 66/155 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 575 event pairs, 42 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 297. Up to 112 conditions per place. [2024-11-07 19:33:38,023 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 25 selfloop transitions, 6 changer transitions 0/39 dead transitions. [2024-11-07 19:33:38,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 39 transitions, 224 flow [2024-11-07 19:33:38,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:33:38,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:33:38,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2024-11-07 19:33:38,025 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-11-07 19:33:38,025 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 166 flow. Second operand 4 states and 65 transitions. [2024-11-07 19:33:38,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 39 transitions, 224 flow [2024-11-07 19:33:38,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 194 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-11-07 19:33:38,028 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 144 flow [2024-11-07 19:33:38,028 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2024-11-07 19:33:38,028 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2024-11-07 19:33:38,028 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 144 flow [2024-11-07 19:33:38,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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:33:38,029 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:38,029 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 19:33:38,032 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 (5)] Ended with exit code 0 [2024-11-07 19:33:38,229 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:33:38,229 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:33:38,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:38,230 INFO L85 PathProgramCache]: Analyzing trace with hash 407994267, now seen corresponding path program 1 times [2024-11-07 19:33:38,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:33:38,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1893341777] [2024-11-07 19:33:38,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:38,230 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:33:38,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:33:38,232 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:33:38,233 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:33:38,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:38,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 19:33:38,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:33:38,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2024-11-07 19:33:38,445 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:33:38,445 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:33:38,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:33:38,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1893341777] [2024-11-07 19:33:38,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1893341777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:33:38,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:33:38,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:33:38,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704428384] [2024-11-07 19:33:38,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:33:38,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:33:38,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:33:38,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:33:38,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:33:38,561 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-07 19:33:38,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 144 flow. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 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:33:38,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:38,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-07 19:33:38,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:38,795 INFO L124 PetriNetUnfolderBase]: 155/314 cut-off events. [2024-11-07 19:33:38,795 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-07 19:33:38,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 314 events. 155/314 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1304 event pairs, 66 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 600. Up to 170 conditions per place. [2024-11-07 19:33:38,800 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 41 selfloop transitions, 11 changer transitions 0/58 dead transitions. [2024-11-07 19:33:38,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 58 transitions, 288 flow [2024-11-07 19:33:38,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:33:38,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:33:38,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-11-07 19:33:38,803 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-11-07 19:33:38,803 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 144 flow. Second operand 6 states and 114 transitions. [2024-11-07 19:33:38,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 58 transitions, 288 flow [2024-11-07 19:33:38,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:33:38,805 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 186 flow [2024-11-07 19:33:38,808 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2024-11-07 19:33:38,808 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places. [2024-11-07 19:33:38,809 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 186 flow [2024-11-07 19:33:38,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 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:33:38,810 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:38,810 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:33:38,814 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:33:39,010 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:33:39,011 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:33:39,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:39,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1231725768, now seen corresponding path program 1 times [2024-11-07 19:33:39,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:33:39,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973248616] [2024-11-07 19:33:39,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:39,011 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:33:39,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:33:39,014 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:33:39,015 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:33:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:39,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 19:33:39,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:33:39,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2024-11-07 19:33:39,232 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:33:39,232 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:33:39,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:33:39,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973248616] [2024-11-07 19:33:39,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973248616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:33:39,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:33:39,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:33:39,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577809432] [2024-11-07 19:33:39,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:33:39,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:33:39,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:33:39,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:33:39,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:33:39,344 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-07 19:33:39,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 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:33:39,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:39,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-07 19:33:39,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:39,579 INFO L124 PetriNetUnfolderBase]: 265/500 cut-off events. [2024-11-07 19:33:39,579 INFO L125 PetriNetUnfolderBase]: For 190/219 co-relation queries the response was YES. [2024-11-07 19:33:39,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1229 conditions, 500 events. 265/500 cut-off events. For 190/219 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2151 event pairs, 114 based on Foata normal form. 20/478 useless extension candidates. Maximal degree in co-relation 1195. Up to 289 conditions per place. [2024-11-07 19:33:39,583 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 47 selfloop transitions, 11 changer transitions 0/65 dead transitions. [2024-11-07 19:33:39,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 65 transitions, 384 flow [2024-11-07 19:33:39,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:33:39,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:33:39,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2024-11-07 19:33:39,585 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-11-07 19:33:39,585 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 186 flow. Second operand 6 states and 112 transitions. [2024-11-07 19:33:39,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 65 transitions, 384 flow [2024-11-07 19:33:39,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 363 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 19:33:39,588 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 220 flow [2024-11-07 19:33:39,588 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2024-11-07 19:33:39,588 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 16 predicate places. [2024-11-07 19:33:39,588 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 220 flow [2024-11-07 19:33:39,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 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:33:39,589 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:39,589 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:33:39,592 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 (7)] Ended with exit code 0 [2024-11-07 19:33:39,789 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:33:39,789 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:33:39,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:39,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1898326016, now seen corresponding path program 1 times [2024-11-07 19:33:39,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:33:39,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309388032] [2024-11-07 19:33:39,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:39,790 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:33:39,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:33:39,792 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:33:39,793 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:33:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:39,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 19:33:39,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:33:39,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2024-11-07 19:33:40,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:33:40,018 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:33:40,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:33:40,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309388032] [2024-11-07 19:33:40,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [309388032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:33:40,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:33:40,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:33:40,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104146050] [2024-11-07 19:33:40,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:33:40,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:33:40,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:33:40,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:33:40,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:33:40,115 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-11-07 19:33:40,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 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:33:40,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:40,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-11-07 19:33:40,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:40,315 INFO L124 PetriNetUnfolderBase]: 222/484 cut-off events. [2024-11-07 19:33:40,315 INFO L125 PetriNetUnfolderBase]: For 314/346 co-relation queries the response was YES. [2024-11-07 19:33:40,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1358 conditions, 484 events. 222/484 cut-off events. For 314/346 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2288 event pairs, 139 based on Foata normal form. 32/502 useless extension candidates. Maximal degree in co-relation 1322. Up to 313 conditions per place. [2024-11-07 19:33:40,319 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 48 selfloop transitions, 5 changer transitions 0/63 dead transitions. [2024-11-07 19:33:40,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 63 transitions, 379 flow [2024-11-07 19:33:40,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:33:40,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:33:40,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2024-11-07 19:33:40,321 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6342857142857142 [2024-11-07 19:33:40,321 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 220 flow. Second operand 5 states and 111 transitions. [2024-11-07 19:33:40,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 63 transitions, 379 flow [2024-11-07 19:33:40,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 63 transitions, 360 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 19:33:40,327 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 242 flow [2024-11-07 19:33:40,328 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=242, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2024-11-07 19:33:40,329 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 19 predicate places. [2024-11-07 19:33:40,330 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 242 flow [2024-11-07 19:33:40,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 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:33:40,330 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:40,330 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2024-11-07 19:33:40,334 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:33:40,530 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:33:40,531 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:33:40,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:40,531 INFO L85 PathProgramCache]: Analyzing trace with hash 53461967, now seen corresponding path program 2 times [2024-11-07 19:33:40,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:33:40,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1156709141] [2024-11-07 19:33:40,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 19:33:40,532 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:33:40,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:33:40,534 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:33:40,535 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:33:40,594 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 19:33:40,595 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:33:40,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 19:33:40,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:33:40,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2024-11-07 19:33:40,833 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:33:40,833 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:33:41,296 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:33:41,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:33:41,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1156709141] [2024-11-07 19:33:41,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1156709141] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:33:41,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 19:33:41,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2024-11-07 19:33:41,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739403137] [2024-11-07 19:33:41,297 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 19:33:41,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 19:33:41,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:33:41,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 19:33:41,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-07 19:33:41,613 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-07 19:33:41,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 242 flow. Second operand has 14 states, 14 states have (on average 14.571428571428571) internal successors, (204), 14 states have internal predecessors, (204), 0 states have call successors, (0), 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:33:41,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:41,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-07 19:33:41,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:43,243 INFO L124 PetriNetUnfolderBase]: 228/510 cut-off events. [2024-11-07 19:33:43,244 INFO L125 PetriNetUnfolderBase]: For 631/680 co-relation queries the response was YES. [2024-11-07 19:33:43,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1561 conditions, 510 events. 228/510 cut-off events. For 631/680 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2437 event pairs, 148 based on Foata normal form. 18/506 useless extension candidates. Maximal degree in co-relation 1457. Up to 366 conditions per place. [2024-11-07 19:33:43,247 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 27 selfloop transitions, 31 changer transitions 0/67 dead transitions. [2024-11-07 19:33:43,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 67 transitions, 448 flow [2024-11-07 19:33:43,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 19:33:43,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-11-07 19:33:43,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 342 transitions. [2024-11-07 19:33:43,250 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44415584415584414 [2024-11-07 19:33:43,250 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 242 flow. Second operand 22 states and 342 transitions. [2024-11-07 19:33:43,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 67 transitions, 448 flow [2024-11-07 19:33:43,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 67 transitions, 443 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:33:43,257 INFO L231 Difference]: Finished difference. Result has 80 places, 67 transitions, 419 flow [2024-11-07 19:33:43,257 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=419, PETRI_PLACES=80, PETRI_TRANSITIONS=67} [2024-11-07 19:33:43,258 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 44 predicate places. [2024-11-07 19:33:43,258 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 67 transitions, 419 flow [2024-11-07 19:33:43,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 14.571428571428571) internal successors, (204), 14 states have internal predecessors, (204), 0 states have call successors, (0), 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:33:43,258 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:43,258 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:33:43,264 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 (9)] Ended with exit code 0 [2024-11-07 19:33:43,459 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:33:43,459 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:33:43,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:43,459 INFO L85 PathProgramCache]: Analyzing trace with hash 311460151, now seen corresponding path program 1 times [2024-11-07 19:33:43,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:33:43,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408705114] [2024-11-07 19:33:43,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:43,460 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:33:43,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:33:43,462 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:33:43,463 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:33:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:43,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 19:33:43,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:33:43,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2024-11-07 19:33:43,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:33:43,723 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:33:44,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:33:44,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:33:44,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [408705114] [2024-11-07 19:33:44,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [408705114] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:33:44,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 19:33:44,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2024-11-07 19:33:44,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755609474] [2024-11-07 19:33:44,067 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 19:33:44,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 19:33:44,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:33:44,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 19:33:44,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-07 19:33:44,542 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-07 19:33:44,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 67 transitions, 419 flow. Second operand has 14 states, 14 states have (on average 13.571428571428571) internal successors, (190), 14 states have internal predecessors, (190), 0 states have call successors, (0), 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:33:44,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:44,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-07 19:33:44,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:45,808 INFO L124 PetriNetUnfolderBase]: 573/1089 cut-off events. [2024-11-07 19:33:45,808 INFO L125 PetriNetUnfolderBase]: For 1016/1095 co-relation queries the response was YES. [2024-11-07 19:33:45,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3418 conditions, 1089 events. 573/1089 cut-off events. For 1016/1095 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 5035 event pairs, 96 based on Foata normal form. 85/1161 useless extension candidates. Maximal degree in co-relation 3363. Up to 274 conditions per place. [2024-11-07 19:33:45,817 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 130 selfloop transitions, 30 changer transitions 0/167 dead transitions. [2024-11-07 19:33:45,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 167 transitions, 1170 flow [2024-11-07 19:33:45,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 19:33:45,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-07 19:33:45,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 262 transitions. [2024-11-07 19:33:45,820 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5758241758241758 [2024-11-07 19:33:45,820 INFO L175 Difference]: Start difference. First operand has 80 places, 67 transitions, 419 flow. Second operand 13 states and 262 transitions. [2024-11-07 19:33:45,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 167 transitions, 1170 flow [2024-11-07 19:33:45,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 167 transitions, 1090 flow, removed 27 selfloop flow, removed 9 redundant places. [2024-11-07 19:33:45,828 INFO L231 Difference]: Finished difference. Result has 87 places, 78 transitions, 497 flow [2024-11-07 19:33:45,828 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=497, PETRI_PLACES=87, PETRI_TRANSITIONS=78} [2024-11-07 19:33:45,829 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 51 predicate places. [2024-11-07 19:33:45,830 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 78 transitions, 497 flow [2024-11-07 19:33:45,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.571428571428571) internal successors, (190), 14 states have internal predecessors, (190), 0 states have call successors, (0), 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:33:45,830 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:45,830 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:33:45,834 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 (10)] Forceful destruction successful, exit code 0 [2024-11-07 19:33:46,030 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:33:46,031 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:33:46,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:46,031 INFO L85 PathProgramCache]: Analyzing trace with hash 134715428, now seen corresponding path program 1 times [2024-11-07 19:33:46,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:33:46,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141993776] [2024-11-07 19:33:46,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:46,031 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:33:46,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:33:46,033 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:33:46,034 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:33:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:46,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 19:33:46,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:33:46,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2024-11-07 19:33:46,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:33:46,346 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:33:46,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:33:46,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:33:46,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [141993776] [2024-11-07 19:33:46,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [141993776] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:33:46,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 19:33:46,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2024-11-07 19:33:46,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156803742] [2024-11-07 19:33:46,684 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 19:33:46,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 19:33:46,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:33:46,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 19:33:46,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-07 19:33:47,140 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-07 19:33:47,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 78 transitions, 497 flow. Second operand has 14 states, 14 states have (on average 13.857142857142858) internal successors, (194), 14 states have internal predecessors, (194), 0 states have call successors, (0), 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:33:47,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:47,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-07 19:33:47,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:48,601 INFO L124 PetriNetUnfolderBase]: 1079/1956 cut-off events. [2024-11-07 19:33:48,601 INFO L125 PetriNetUnfolderBase]: For 4300/4462 co-relation queries the response was YES. [2024-11-07 19:33:48,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7201 conditions, 1956 events. 1079/1956 cut-off events. For 4300/4462 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 9738 event pairs, 223 based on Foata normal form. 98/2004 useless extension candidates. Maximal degree in co-relation 7147. Up to 529 conditions per place. [2024-11-07 19:33:48,619 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 185 selfloop transitions, 29 changer transitions 2/227 dead transitions. [2024-11-07 19:33:48,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 227 transitions, 2011 flow [2024-11-07 19:33:48,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 19:33:48,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-07 19:33:48,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 252 transitions. [2024-11-07 19:33:48,623 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5538461538461539 [2024-11-07 19:33:48,623 INFO L175 Difference]: Start difference. First operand has 87 places, 78 transitions, 497 flow. Second operand 13 states and 252 transitions. [2024-11-07 19:33:48,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 227 transitions, 2011 flow [2024-11-07 19:33:48,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 227 transitions, 1828 flow, removed 60 selfloop flow, removed 4 redundant places. [2024-11-07 19:33:48,634 INFO L231 Difference]: Finished difference. Result has 99 places, 89 transitions, 620 flow [2024-11-07 19:33:48,635 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=620, PETRI_PLACES=99, PETRI_TRANSITIONS=89} [2024-11-07 19:33:48,636 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 63 predicate places. [2024-11-07 19:33:48,636 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 89 transitions, 620 flow [2024-11-07 19:33:48,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.857142857142858) internal successors, (194), 14 states have internal predecessors, (194), 0 states have call successors, (0), 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:33:48,637 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:48,637 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:33:48,642 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 (11)] Ended with exit code 0 [2024-11-07 19:33:48,838 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:33:48,838 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:33:48,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:48,838 INFO L85 PathProgramCache]: Analyzing trace with hash 321109837, now seen corresponding path program 1 times [2024-11-07 19:33:48,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:33:48,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [619101757] [2024-11-07 19:33:48,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:48,839 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:33:48,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:33:48,841 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:33:48,842 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:33:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:48,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 19:33:48,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:33:48,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:33:48,907 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:33:48,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:33:48,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [619101757] [2024-11-07 19:33:48,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [619101757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:33:48,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:33:48,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:33:48,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129003688] [2024-11-07 19:33:48,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:33:48,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:33:48,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:33:48,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:33:48,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:33:48,913 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-07 19:33:48,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 89 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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:33:48,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:48,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-07 19:33:48,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:49,242 INFO L124 PetriNetUnfolderBase]: 1266/2368 cut-off events. [2024-11-07 19:33:49,242 INFO L125 PetriNetUnfolderBase]: For 5836/5911 co-relation queries the response was YES. [2024-11-07 19:33:49,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9138 conditions, 2368 events. 1266/2368 cut-off events. For 5836/5911 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 12090 event pairs, 420 based on Foata normal form. 2/2326 useless extension candidates. Maximal degree in co-relation 9079. Up to 1823 conditions per place. [2024-11-07 19:33:49,263 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 81 selfloop transitions, 3 changer transitions 4/104 dead transitions. [2024-11-07 19:33:49,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 104 transitions, 881 flow [2024-11-07 19:33:49,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:33:49,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:33:49,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-11-07 19:33:49,265 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6761904761904762 [2024-11-07 19:33:49,265 INFO L175 Difference]: Start difference. First operand has 99 places, 89 transitions, 620 flow. Second operand 3 states and 71 transitions. [2024-11-07 19:33:49,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 104 transitions, 881 flow [2024-11-07 19:33:49,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 104 transitions, 843 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-11-07 19:33:49,277 INFO L231 Difference]: Finished difference. Result has 98 places, 88 transitions, 575 flow [2024-11-07 19:33:49,278 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=575, PETRI_PLACES=98, PETRI_TRANSITIONS=88} [2024-11-07 19:33:49,278 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 62 predicate places. [2024-11-07 19:33:49,278 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 88 transitions, 575 flow [2024-11-07 19:33:49,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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:33:49,279 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:49,279 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] [2024-11-07 19:33:49,283 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:33:49,481 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:33:49,482 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:33:49,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:49,482 INFO L85 PathProgramCache]: Analyzing trace with hash 869469909, now seen corresponding path program 1 times [2024-11-07 19:33:49,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:33:49,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556666998] [2024-11-07 19:33:49,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:49,483 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:33:49,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:33:49,485 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:33:49,486 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:33:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:49,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 19:33:49,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:33:49,643 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:33:49,643 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:33:49,750 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:33:49,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:33:49,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556666998] [2024-11-07 19:33:49,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556666998] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:33:49,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 19:33:49,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-07 19:33:49,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253112553] [2024-11-07 19:33:49,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 19:33:49,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 19:33:49,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:33:49,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 19:33:49,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-07 19:33:49,819 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-07 19:33:49,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 88 transitions, 575 flow. Second operand has 12 states, 12 states have (on average 15.416666666666666) internal successors, (185), 12 states have internal predecessors, (185), 0 states have call successors, (0), 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:33:49,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:49,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-07 19:33:49,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:50,464 INFO L124 PetriNetUnfolderBase]: 2113/3950 cut-off events. [2024-11-07 19:33:50,464 INFO L125 PetriNetUnfolderBase]: For 9461/9775 co-relation queries the response was YES. [2024-11-07 19:33:50,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15215 conditions, 3950 events. 2113/3950 cut-off events. For 9461/9775 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 24262 event pairs, 662 based on Foata normal form. 88/3882 useless extension candidates. Maximal degree in co-relation 15160. Up to 991 conditions per place. [2024-11-07 19:33:50,503 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 134 selfloop transitions, 23 changer transitions 0/171 dead transitions. [2024-11-07 19:33:50,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 171 transitions, 1427 flow [2024-11-07 19:33:50,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 19:33:50,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-07 19:33:50,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions. [2024-11-07 19:33:50,505 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2024-11-07 19:33:50,506 INFO L175 Difference]: Start difference. First operand has 98 places, 88 transitions, 575 flow. Second operand 10 states and 195 transitions. [2024-11-07 19:33:50,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 171 transitions, 1427 flow [2024-11-07 19:33:50,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 171 transitions, 1380 flow, removed 22 selfloop flow, removed 2 redundant places. [2024-11-07 19:33:50,527 INFO L231 Difference]: Finished difference. Result has 103 places, 96 transitions, 653 flow [2024-11-07 19:33:50,527 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=653, PETRI_PLACES=103, PETRI_TRANSITIONS=96} [2024-11-07 19:33:50,527 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 67 predicate places. [2024-11-07 19:33:50,528 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 96 transitions, 653 flow [2024-11-07 19:33:50,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.416666666666666) internal successors, (185), 12 states have internal predecessors, (185), 0 states have call successors, (0), 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:33:50,528 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:50,528 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] [2024-11-07 19:33:50,532 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 (13)] Ended with exit code 0 [2024-11-07 19:33:50,728 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:33:50,729 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:33:50,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:50,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1385154367, now seen corresponding path program 1 times [2024-11-07 19:33:50,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:33:50,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1092331239] [2024-11-07 19:33:50,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:50,730 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:33:50,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:33:50,732 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:33:50,733 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:33:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:50,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 19:33:50,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:33:50,903 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:33:50,904 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:33:51,033 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:33:51,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:33:51,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1092331239] [2024-11-07 19:33:51,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1092331239] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:33:51,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 19:33:51,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-07 19:33:51,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653912995] [2024-11-07 19:33:51,034 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 19:33:51,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 19:33:51,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:33:51,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 19:33:51,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-07 19:33:51,129 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-07 19:33:51,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 96 transitions, 653 flow. Second operand has 12 states, 12 states have (on average 15.166666666666666) internal successors, (182), 12 states have internal predecessors, (182), 0 states have call successors, (0), 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:33:51,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:51,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-07 19:33:51,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:51,682 INFO L124 PetriNetUnfolderBase]: 2031/3830 cut-off events. [2024-11-07 19:33:51,683 INFO L125 PetriNetUnfolderBase]: For 9597/9985 co-relation queries the response was YES. [2024-11-07 19:33:51,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14841 conditions, 3830 events. 2031/3830 cut-off events. For 9597/9985 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 24069 event pairs, 616 based on Foata normal form. 138/3824 useless extension candidates. Maximal degree in co-relation 14784. Up to 957 conditions per place. [2024-11-07 19:33:51,711 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 132 selfloop transitions, 23 changer transitions 0/173 dead transitions. [2024-11-07 19:33:51,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 173 transitions, 1462 flow [2024-11-07 19:33:51,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 19:33:51,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-07 19:33:51,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 198 transitions. [2024-11-07 19:33:51,712 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5657142857142857 [2024-11-07 19:33:51,712 INFO L175 Difference]: Start difference. First operand has 103 places, 96 transitions, 653 flow. Second operand 10 states and 198 transitions. [2024-11-07 19:33:51,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 173 transitions, 1462 flow [2024-11-07 19:33:51,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 173 transitions, 1444 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-07 19:33:51,728 INFO L231 Difference]: Finished difference. Result has 108 places, 104 transitions, 736 flow [2024-11-07 19:33:51,728 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=736, PETRI_PLACES=108, PETRI_TRANSITIONS=104} [2024-11-07 19:33:51,729 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 72 predicate places. [2024-11-07 19:33:51,729 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 104 transitions, 736 flow [2024-11-07 19:33:51,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.166666666666666) internal successors, (182), 12 states have internal predecessors, (182), 0 states have call successors, (0), 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:33:51,729 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:51,729 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1] [2024-11-07 19:33:51,733 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:33:51,929 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:33:51,930 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:33:51,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:51,930 INFO L85 PathProgramCache]: Analyzing trace with hash 311580677, now seen corresponding path program 3 times [2024-11-07 19:33:51,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:33:51,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1547386976] [2024-11-07 19:33:51,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 19:33:51,931 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:33:51,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:33:51,932 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:33:51,934 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:33:52,046 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-07 19:33:52,046 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:33:52,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-07 19:33:52,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:33:52,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2024-11-07 19:33:52,461 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:33:52,461 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:33:53,967 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:33:53,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:33:53,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1547386976] [2024-11-07 19:33:53,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1547386976] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:33:53,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 19:33:53,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2024-11-07 19:33:53,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834593710] [2024-11-07 19:33:53,968 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 19:33:53,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-07 19:33:53,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:33:53,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-07 19:33:53,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=477, Unknown=0, NotChecked=0, Total=650 [2024-11-07 19:33:55,214 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-07 19:33:55,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 104 transitions, 736 flow. Second operand has 26 states, 26 states have (on average 14.76923076923077) internal successors, (384), 26 states have internal predecessors, (384), 0 states have call successors, (0), 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:33:55,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:55,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-07 19:33:55,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:34:07,124 INFO L124 PetriNetUnfolderBase]: 1707/3372 cut-off events. [2024-11-07 19:34:07,124 INFO L125 PetriNetUnfolderBase]: For 10114/10451 co-relation queries the response was YES. [2024-11-07 19:34:07,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13588 conditions, 3372 events. 1707/3372 cut-off events. For 10114/10451 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 21711 event pairs, 1216 based on Foata normal form. 20/3172 useless extension candidates. Maximal degree in co-relation 13374. Up to 2471 conditions per place. [2024-11-07 19:34:07,142 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 47 selfloop transitions, 66 changer transitions 0/140 dead transitions. [2024-11-07 19:34:07,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 140 transitions, 1190 flow [2024-11-07 19:34:07,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-07 19:34:07,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2024-11-07 19:34:07,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 695 transitions. [2024-11-07 19:34:07,146 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.43167701863354035 [2024-11-07 19:34:07,146 INFO L175 Difference]: Start difference. First operand has 108 places, 104 transitions, 736 flow. Second operand 46 states and 695 transitions. [2024-11-07 19:34:07,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 140 transitions, 1190 flow [2024-11-07 19:34:07,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 140 transitions, 1182 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 19:34:07,162 INFO L231 Difference]: Finished difference. Result has 161 places, 140 transitions, 1142 flow [2024-11-07 19:34:07,162 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=1142, PETRI_PLACES=161, PETRI_TRANSITIONS=140} [2024-11-07 19:34:07,163 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 125 predicate places. [2024-11-07 19:34:07,163 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 140 transitions, 1142 flow [2024-11-07 19:34:07,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 14.76923076923077) internal successors, (384), 26 states have internal predecessors, (384), 0 states have call successors, (0), 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:34:07,163 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:34:07,163 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:34:07,168 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 (15)] Ended with exit code 0 [2024-11-07 19:34:07,364 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:34:07,364 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:34:07,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:34:07,365 INFO L85 PathProgramCache]: Analyzing trace with hash -82775356, now seen corresponding path program 1 times [2024-11-07 19:34:07,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:34:07,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [707208203] [2024-11-07 19:34:07,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:34:07,365 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:34:07,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:34:07,367 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:34:07,368 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:34:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:34:07,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 19:34:07,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:34:07,499 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 14 treesize of output 6 [2024-11-07 19:34:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:34:07,522 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:34:07,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:34:07,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2024-11-07 19:34:07,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:34:07,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:34:07,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [707208203] [2024-11-07 19:34:07,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [707208203] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:34:07,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 19:34:07,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-11-07 19:34:07,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287055457] [2024-11-07 19:34:07,622 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 19:34:07,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 19:34:07,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:34:07,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 19:34:07,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-07 19:34:07,780 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-07 19:34:07,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 140 transitions, 1142 flow. Second operand has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 0 states have call successors, (0), 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:34:07,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:34:07,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-07 19:34:07,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:34:08,807 INFO L124 PetriNetUnfolderBase]: 3550/6570 cut-off events. [2024-11-07 19:34:08,807 INFO L125 PetriNetUnfolderBase]: For 15601/15931 co-relation queries the response was YES. [2024-11-07 19:34:08,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26187 conditions, 6570 events. 3550/6570 cut-off events. For 15601/15931 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 44111 event pairs, 789 based on Foata normal form. 12/6424 useless extension candidates. Maximal degree in co-relation 26098. Up to 3665 conditions per place. [2024-11-07 19:34:08,850 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 245 selfloop transitions, 46 changer transitions 1/316 dead transitions. [2024-11-07 19:34:08,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 316 transitions, 2813 flow [2024-11-07 19:34:08,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 19:34:08,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-07 19:34:08,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 313 transitions. [2024-11-07 19:34:08,852 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5589285714285714 [2024-11-07 19:34:08,852 INFO L175 Difference]: Start difference. First operand has 161 places, 140 transitions, 1142 flow. Second operand 16 states and 313 transitions. [2024-11-07 19:34:08,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 316 transitions, 2813 flow [2024-11-07 19:34:08,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 316 transitions, 2651 flow, removed 51 selfloop flow, removed 21 redundant places. [2024-11-07 19:34:08,890 INFO L231 Difference]: Finished difference. Result has 164 places, 185 transitions, 1448 flow [2024-11-07 19:34:08,891 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=980, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1448, PETRI_PLACES=164, PETRI_TRANSITIONS=185} [2024-11-07 19:34:08,891 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 128 predicate places. [2024-11-07 19:34:08,891 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 185 transitions, 1448 flow [2024-11-07 19:34:08,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 0 states have call successors, (0), 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:34:08,891 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:34:08,892 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:34:08,896 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:34:09,092 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:34:09,092 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 19:34:09,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:34:09,093 INFO L85 PathProgramCache]: Analyzing trace with hash -954219898, now seen corresponding path program 2 times [2024-11-07 19:34:09,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:34:09,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1464358710] [2024-11-07 19:34:09,093 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 19:34:09,093 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:34:09,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:34:09,095 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:34:09,096 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:34:09,172 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 19:34:09,172 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-07 19:34:09,172 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:34:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:34:09,289 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-07 19:34:09,289 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:34:09,290 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (13 of 14 remaining) [2024-11-07 19:34:09,292 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2024-11-07 19:34:09,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2024-11-07 19:34:09,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2024-11-07 19:34:09,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2024-11-07 19:34:09,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2024-11-07 19:34:09,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2024-11-07 19:34:09,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (6 of 14 remaining) [2024-11-07 19:34:09,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 14 remaining) [2024-11-07 19:34:09,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 14 remaining) [2024-11-07 19:34:09,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2024-11-07 19:34:09,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2024-11-07 19:34:09,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2024-11-07 19:34:09,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 14 remaining) [2024-11-07 19:34:09,300 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:34:09,494 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:34:09,495 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:34:09,527 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 19:34:09,528 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 19:34:09,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:34:09 BasicIcfg [2024-11-07 19:34:09,533 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 19:34:09,533 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 19:34:09,533 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 19:34:09,534 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 19:34:09,534 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:33:34" (3/4) ... [2024-11-07 19:34:09,535 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 19:34:09,536 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 19:34:09,537 INFO L158 Benchmark]: Toolchain (without parser) took 35791.41ms. Allocated memory was 83.9MB in the beginning and 620.8MB in the end (delta: 536.9MB). Free memory was 60.9MB in the beginning and 378.5MB in the end (delta: -317.6MB). Peak memory consumption was 222.6MB. Max. memory is 16.1GB. [2024-11-07 19:34:09,537 INFO L158 Benchmark]: CDTParser took 0.72ms. Allocated memory is still 83.9MB. Free memory was 65.4MB in the beginning and 65.4MB in the end (delta: 37.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:34:09,538 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.04ms. Allocated memory is still 83.9MB. Free memory was 60.6MB in the beginning and 48.5MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 19:34:09,538 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.63ms. Allocated memory is still 83.9MB. Free memory was 48.5MB in the beginning and 46.6MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 19:34:09,539 INFO L158 Benchmark]: Boogie Preprocessor took 63.38ms. Allocated memory is still 83.9MB. Free memory was 46.6MB in the beginning and 44.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:34:09,539 INFO L158 Benchmark]: RCFGBuilder took 844.30ms. Allocated memory is still 83.9MB. Free memory was 44.5MB in the beginning and 25.5MB in the end (delta: 19.0MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2024-11-07 19:34:09,540 INFO L158 Benchmark]: TraceAbstraction took 34560.50ms. Allocated memory was 83.9MB in the beginning and 620.8MB in the end (delta: 536.9MB). Free memory was 25.0MB in the beginning and 382.7MB in the end (delta: -357.7MB). Peak memory consumption was 177.1MB. Max. memory is 16.1GB. [2024-11-07 19:34:09,540 INFO L158 Benchmark]: Witness Printer took 3.21ms. Allocated memory is still 620.8MB. Free memory was 382.7MB in the beginning and 378.5MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 19:34:09,541 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.72ms. Allocated memory is still 83.9MB. Free memory was 65.4MB in the beginning and 65.4MB in the end (delta: 37.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.04ms. Allocated memory is still 83.9MB. Free memory was 60.6MB in the beginning and 48.5MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.63ms. Allocated memory is still 83.9MB. Free memory was 48.5MB in the beginning and 46.6MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.38ms. Allocated memory is still 83.9MB. Free memory was 46.6MB in the beginning and 44.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 844.30ms. Allocated memory is still 83.9MB. Free memory was 44.5MB in the beginning and 25.5MB in the end (delta: 19.0MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. * TraceAbstraction took 34560.50ms. Allocated memory was 83.9MB in the beginning and 620.8MB in the end (delta: 536.9MB). Free memory was 25.0MB in the beginning and 382.7MB in the end (delta: -357.7MB). Peak memory consumption was 177.1MB. Max. memory is 16.1GB. * Witness Printer took 3.21ms. Allocated memory is still 620.8MB. Free memory was 382.7MB in the beginning and 378.5MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 21]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 21. Possible FailurePath: [L39] 0 int* A; [L40] 0 _Atomic int counter; [L41] 0 int N; [L66] 0 pthread_t t1, t2; [L68] 0 N = __VERIFIER_nondet_int() [L69] CALL, EXPR 0 create_fresh_int_array(N) [L84] CALL 0 assume_abort_if_not(size >= 0) [L36] COND FALSE 0 !(!cond) [L84] RET 0 assume_abort_if_not(size >= 0) [L85] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L36] COND FALSE 0 !(!cond) [L85] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L87] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L88] 0 int i = 0; VAL [A={0:0}, N=1, \old(size)=1, arr={3:0}, counter=0, i=0, size=1] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=1, \old(size)=1, arr={3:0}, counter=0, i=1, size=1] [L88] COND FALSE 0 !(i < size) [L91] 0 return arr; [L69] RET, EXPR 0 create_fresh_int_array(N) [L69] 0 A = create_fresh_int_array(N) [L72] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={3:0}, N=1, counter=0, t1=0] [L73] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={3:0}, N=1, counter=0, t1=0, t2=1] [L57] 2 int i=0; VAL [A={3:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L48] 1 int i=0; VAL [A={3:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L50] 1 counter = tmp VAL [A={3:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=262144, i=0, tmp=262144] [L48] 1 i++ VAL [A={3:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=262144, i=1] [L48] COND FALSE 1 !(i