./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml', '-i', '../sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G valid-free) )\nCHECK( init(main()), LTL(G valid-deref) )\nCHECK( init(main()), LTL(G valid-memtrack) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '3bc57c42fd552df471a50a3f823d776d12ae5a02a1da1686aaab749af4f270bf'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3bc57c42fd552df471a50a3f823d776d12ae5a02a1da1686aaab749af4f270bf --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:11:46,183 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:11:46,284 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:11:46,290 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:11:46,290 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:11:46,322 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:11:46,323 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:11:46,323 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:11:46,324 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:11:46,324 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:11:46,324 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:11:46,325 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:11:46,325 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:11:46,325 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:11:46,326 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:11:46,326 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:11:46,326 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:11:46,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:11:46,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:11:46,327 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:11:46,327 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 19:11:46,327 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 19:11:46,327 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 19:11:46,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:11:46,327 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:11:46,327 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:11:46,327 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:11:46,328 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:11:46,328 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:11:46,328 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:11:46,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:11:46,328 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:11:46,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:11:46,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:11:46,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:11:46,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:11:46,329 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 19:11:46,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 19:11:46,329 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:11:46,329 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:11:46,329 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:11:46,330 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:11:46,330 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 -> 3bc57c42fd552df471a50a3f823d776d12ae5a02a1da1686aaab749af4f270bf [2024-11-07 19:11:46,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:11:46,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:11:46,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:11:46,604 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:11:46,605 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:11:46,605 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i [2024-11-07 19:11:47,785 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:11:48,044 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:11:48,044 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i [2024-11-07 19:11:48,052 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e890cfecc/36831a8f35b04eb2b2dbcee124660648/FLAGad055ccb2 [2024-11-07 19:11:48,366 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e890cfecc/36831a8f35b04eb2b2dbcee124660648 [2024-11-07 19:11:48,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:11:48,369 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:11:48,370 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:11:48,371 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:11:48,374 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:11:48,375 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:11:48" (1/1) ... [2024-11-07 19:11:48,375 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22deb575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:11:48, skipping insertion in model container [2024-11-07 19:11:48,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:11:48" (1/1) ... [2024-11-07 19:11:48,407 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:11:48,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:11:48,738 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:11:48,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:11:48,840 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:11:48,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:11:48 WrapperNode [2024-11-07 19:11:48,841 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:11:48,842 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:11:48,842 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:11:48,842 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:11:48,847 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:11:48" (1/1) ... [2024-11-07 19:11:48,862 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:11:48" (1/1) ... [2024-11-07 19:11:48,884 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2024-11-07 19:11:48,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:11:48,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:11:48,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:11:48,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:11:48,893 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:11:48" (1/1) ... [2024-11-07 19:11:48,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:11:48" (1/1) ... [2024-11-07 19:11:48,899 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:11:48" (1/1) ... [2024-11-07 19:11:48,916 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 19:11:48,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:11:48" (1/1) ... [2024-11-07 19:11:48,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:11:48" (1/1) ... [2024-11-07 19:11:48,925 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:11:48" (1/1) ... [2024-11-07 19:11:48,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:11:48" (1/1) ... [2024-11-07 19:11:48,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:11:48" (1/1) ... [2024-11-07 19:11:48,930 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:11:48" (1/1) ... [2024-11-07 19:11:48,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:11:48,933 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:11:48,933 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:11:48,934 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:11:48,934 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:11:48" (1/1) ... [2024-11-07 19:11:48,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:11:48,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:11:48,960 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:11:48,963 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:11:48,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-07 19:11:48,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:11:48,981 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-07 19:11:48,981 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-07 19:11:48,982 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-07 19:11:48,982 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-07 19:11:48,982 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-07 19:11:48,982 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-07 19:11:48,982 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-07 19:11:48,982 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-07 19:11:48,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 19:11:48,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-07 19:11:48,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:11:48,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:11:48,984 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:11:49,102 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:11:49,104 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:11:49,449 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 19:11:49,450 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:11:49,639 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:11:49,640 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 19:11:49,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:11:49 BoogieIcfgContainer [2024-11-07 19:11:49,641 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:11:49,643 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:11:49,643 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:11:49,647 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:11:49,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:11:48" (1/3) ... [2024-11-07 19:11:49,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c71766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:11:49, skipping insertion in model container [2024-11-07 19:11:49,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:11:48" (2/3) ... [2024-11-07 19:11:49,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c71766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:11:49, skipping insertion in model container [2024-11-07 19:11:49,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:11:49" (3/3) ... [2024-11-07 19:11:49,650 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018_tso.oepc.i [2024-11-07 19:11:49,661 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:11:49,661 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-07 19:11:49,662 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 19:11:49,732 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 19:11:49,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 54 transitions, 124 flow [2024-11-07 19:11:49,803 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2024-11-07 19:11:49,804 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:11:49,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 50 events. 2/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 101 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2024-11-07 19:11:49,806 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 54 transitions, 124 flow [2024-11-07 19:11:49,812 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 50 transitions, 112 flow [2024-11-07 19:11:49,820 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:11:49,835 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;@31869fdc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:11:49,835 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-07 19:11:49,842 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:11:49,842 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-11-07 19:11:49,842 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:11:49,842 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:11:49,842 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 19:11:49,842 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-07 19:11:49,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:11:49,848 INFO L85 PathProgramCache]: Analyzing trace with hash -496086890, now seen corresponding path program 1 times [2024-11-07 19:11:49,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:11:49,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382063447] [2024-11-07 19:11:49,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:11:49,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:11:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:11:50,188 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:11:50,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:11:50,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382063447] [2024-11-07 19:11:50,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382063447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:11:50,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:11:50,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:11:50,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371484449] [2024-11-07 19:11:50,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:11:50,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:11:50,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:11:50,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:11:50,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:11:50,223 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-11-07 19:11:50,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:11:50,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:11:50,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-11-07 19:11:50,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:11:50,926 INFO L124 PetriNetUnfolderBase]: 2754/4562 cut-off events. [2024-11-07 19:11:50,926 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-11-07 19:11:50,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8501 conditions, 4562 events. 2754/4562 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 32088 event pairs, 492 based on Foata normal form. 216/4703 useless extension candidates. Maximal degree in co-relation 8489. Up to 3064 conditions per place. [2024-11-07 19:11:50,951 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 39 selfloop transitions, 2 changer transitions 2/64 dead transitions. [2024-11-07 19:11:50,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 64 transitions, 232 flow [2024-11-07 19:11:50,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:11:50,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:11:50,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2024-11-07 19:11:50,961 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7592592592592593 [2024-11-07 19:11:50,962 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 123 transitions. [2024-11-07 19:11:50,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 64 transitions, 232 flow [2024-11-07 19:11:50,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 64 transitions, 226 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 19:11:50,968 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 102 flow [2024-11-07 19:11:50,970 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2024-11-07 19:11:50,973 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2024-11-07 19:11:50,974 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 102 flow [2024-11-07 19:11:50,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:11:50,974 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:11:50,974 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:11:50,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 19:11:50,975 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-07 19:11:50,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:11:50,976 INFO L85 PathProgramCache]: Analyzing trace with hash 5700595, now seen corresponding path program 1 times [2024-11-07 19:11:50,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:11:50,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666844479] [2024-11-07 19:11:50,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:11:50,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:11:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:11:51,094 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:11:51,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:11:51,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666844479] [2024-11-07 19:11:51,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666844479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:11:51,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:11:51,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:11:51,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004457547] [2024-11-07 19:11:51,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:11:51,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:11:51,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:11:51,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:11:51,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:11:51,100 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 54 [2024-11-07 19:11:51,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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:11:51,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:11:51,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 54 [2024-11-07 19:11:51,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:11:51,591 INFO L124 PetriNetUnfolderBase]: 2457/4097 cut-off events. [2024-11-07 19:11:51,592 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2024-11-07 19:11:51,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7869 conditions, 4097 events. 2457/4097 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 28299 event pairs, 2457 based on Foata normal form. 108/4001 useless extension candidates. Maximal degree in co-relation 7859. Up to 3424 conditions per place. [2024-11-07 19:11:51,607 INFO L140 encePairwiseOnDemand]: 52/54 looper letters, 22 selfloop transitions, 1 changer transitions 1/44 dead transitions. [2024-11-07 19:11:51,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 44 transitions, 148 flow [2024-11-07 19:11:51,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:11:51,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:11:51,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-11-07 19:11:51,608 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5987654320987654 [2024-11-07 19:11:51,608 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 97 transitions. [2024-11-07 19:11:51,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 44 transitions, 148 flow [2024-11-07 19:11:51,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 44 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:11:51,609 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 96 flow [2024-11-07 19:11:51,610 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2024-11-07 19:11:51,610 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -6 predicate places. [2024-11-07 19:11:51,610 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 96 flow [2024-11-07 19:11:51,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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:11:51,610 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:11:51,611 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:11:51,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 19:11:51,611 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-07 19:11:51,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:11:51,611 INFO L85 PathProgramCache]: Analyzing trace with hash 5701787, now seen corresponding path program 1 times [2024-11-07 19:11:51,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:11:51,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183905215] [2024-11-07 19:11:51,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:11:51,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:11:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:11:51,846 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:11:51,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:11:51,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183905215] [2024-11-07 19:11:51,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183905215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:11:51,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:11:51,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:11:51,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339521905] [2024-11-07 19:11:51,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:11:51,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:11:51,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:11:51,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:11:51,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:11:51,869 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54 [2024-11-07 19:11:51,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:11:51,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:11:51,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54 [2024-11-07 19:11:51,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:11:52,982 INFO L124 PetriNetUnfolderBase]: 8029/11935 cut-off events. [2024-11-07 19:11:52,983 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:11:52,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23123 conditions, 11935 events. 8029/11935 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 721. Compared 80329 event pairs, 869 based on Foata normal form. 320/11992 useless extension candidates. Maximal degree in co-relation 23117. Up to 7057 conditions per place. [2024-11-07 19:11:53,049 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 51 selfloop transitions, 6 changer transitions 1/73 dead transitions. [2024-11-07 19:11:53,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 73 transitions, 278 flow [2024-11-07 19:11:53,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:11:53,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:11:53,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2024-11-07 19:11:53,052 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2024-11-07 19:11:53,053 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 96 flow. Second operand 4 states and 140 transitions. [2024-11-07 19:11:53,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 73 transitions, 278 flow [2024-11-07 19:11:53,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 73 transitions, 277 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:11:53,056 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 137 flow [2024-11-07 19:11:53,056 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2024-11-07 19:11:53,057 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places. [2024-11-07 19:11:53,057 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 137 flow [2024-11-07 19:11:53,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:11:53,057 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:11:53,057 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:11:53,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 19:11:53,058 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-07 19:11:53,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:11:53,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1992727186, now seen corresponding path program 1 times [2024-11-07 19:11:53,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:11:53,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835739044] [2024-11-07 19:11:53,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:11:53,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:11:53,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:11:53,355 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:11:53,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:11:53,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835739044] [2024-11-07 19:11:53,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835739044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:11:53,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:11:53,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:11:53,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374292810] [2024-11-07 19:11:53,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:11:53,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:11:53,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:11:53,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:11:53,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:11:53,364 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54 [2024-11-07 19:11:53,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 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:11:53,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:11:53,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54 [2024-11-07 19:11:53,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:11:54,531 INFO L124 PetriNetUnfolderBase]: 6173/9263 cut-off events. [2024-11-07 19:11:54,532 INFO L125 PetriNetUnfolderBase]: For 2252/2252 co-relation queries the response was YES. [2024-11-07 19:11:54,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21026 conditions, 9263 events. 6173/9263 cut-off events. For 2252/2252 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 59708 event pairs, 369 based on Foata normal form. 296/9357 useless extension candidates. Maximal degree in co-relation 21017. Up to 4681 conditions per place. [2024-11-07 19:11:54,571 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 65 selfloop transitions, 10 changer transitions 1/91 dead transitions. [2024-11-07 19:11:54,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 91 transitions, 406 flow [2024-11-07 19:11:54,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:11:54,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:11:54,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 178 transitions. [2024-11-07 19:11:54,573 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6592592592592592 [2024-11-07 19:11:54,573 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 137 flow. Second operand 5 states and 178 transitions. [2024-11-07 19:11:54,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 91 transitions, 406 flow [2024-11-07 19:11:54,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 91 transitions, 395 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-07 19:11:54,580 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 189 flow [2024-11-07 19:11:54,580 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=189, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2024-11-07 19:11:54,580 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 1 predicate places. [2024-11-07 19:11:54,580 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 189 flow [2024-11-07 19:11:54,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 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:11:54,580 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:11:54,580 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:11:54,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 19:11:54,581 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-07 19:11:54,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:11:54,585 INFO L85 PathProgramCache]: Analyzing trace with hash -324975811, now seen corresponding path program 1 times [2024-11-07 19:11:54,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:11:54,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990274223] [2024-11-07 19:11:54,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:11:54,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:11:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:11:54,809 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:11:54,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:11:54,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990274223] [2024-11-07 19:11:54,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990274223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:11:54,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:11:54,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:11:54,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037567718] [2024-11-07 19:11:54,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:11:54,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:11:54,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:11:54,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:11:54,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:11:54,814 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54 [2024-11-07 19:11:54,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 189 flow. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 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:11:54,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:11:54,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54 [2024-11-07 19:11:54,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:11:55,281 INFO L124 PetriNetUnfolderBase]: 3825/5747 cut-off events. [2024-11-07 19:11:55,282 INFO L125 PetriNetUnfolderBase]: For 4281/4281 co-relation queries the response was YES. [2024-11-07 19:11:55,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14636 conditions, 5747 events. 3825/5747 cut-off events. For 4281/4281 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 32932 event pairs, 221 based on Foata normal form. 208/5788 useless extension candidates. Maximal degree in co-relation 14625. Up to 1801 conditions per place. [2024-11-07 19:11:55,301 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 77 selfloop transitions, 14 changer transitions 1/107 dead transitions. [2024-11-07 19:11:55,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 107 transitions, 533 flow [2024-11-07 19:11:55,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:11:55,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:11:55,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 214 transitions. [2024-11-07 19:11:55,303 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6604938271604939 [2024-11-07 19:11:55,303 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 189 flow. Second operand 6 states and 214 transitions. [2024-11-07 19:11:55,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 107 transitions, 533 flow [2024-11-07 19:11:55,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 107 transitions, 503 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-07 19:11:55,315 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 239 flow [2024-11-07 19:11:55,316 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=239, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2024-11-07 19:11:55,316 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 4 predicate places. [2024-11-07 19:11:55,317 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 239 flow [2024-11-07 19:11:55,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 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:11:55,317 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:11:55,317 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:11:55,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 19:11:55,318 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-07 19:11:55,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:11:55,320 INFO L85 PathProgramCache]: Analyzing trace with hash 526904793, now seen corresponding path program 1 times [2024-11-07 19:11:55,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:11:55,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201254682] [2024-11-07 19:11:55,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:11:55,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:11:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:11:55,588 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:11:55,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:11:55,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201254682] [2024-11-07 19:11:55,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201254682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:11:55,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:11:55,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:11:55,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171486268] [2024-11-07 19:11:55,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:11:55,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 19:11:55,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:11:55,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 19:11:55,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:11:55,600 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54 [2024-11-07 19:11:55,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 239 flow. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 0 states have call successors, (0), 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:11:55,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:11:55,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54 [2024-11-07 19:11:55,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:11:56,358 INFO L124 PetriNetUnfolderBase]: 2457/3611 cut-off events. [2024-11-07 19:11:56,358 INFO L125 PetriNetUnfolderBase]: For 4477/4477 co-relation queries the response was YES. [2024-11-07 19:11:56,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10117 conditions, 3611 events. 2457/3611 cut-off events. For 4477/4477 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 18533 event pairs, 173 based on Foata normal form. 88/3539 useless extension candidates. Maximal degree in co-relation 10105. Up to 1088 conditions per place. [2024-11-07 19:11:56,392 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 69 selfloop transitions, 18 changer transitions 1/103 dead transitions. [2024-11-07 19:11:56,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 103 transitions, 527 flow [2024-11-07 19:11:56,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 19:11:56,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-07 19:11:56,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 230 transitions. [2024-11-07 19:11:56,394 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6084656084656085 [2024-11-07 19:11:56,396 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 239 flow. Second operand 7 states and 230 transitions. [2024-11-07 19:11:56,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 103 transitions, 527 flow [2024-11-07 19:11:56,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 103 transitions, 481 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-07 19:11:56,429 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 249 flow [2024-11-07 19:11:56,429 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=249, PETRI_PLACES=68, PETRI_TRANSITIONS=55} [2024-11-07 19:11:56,430 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 7 predicate places. [2024-11-07 19:11:56,430 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 249 flow [2024-11-07 19:11:56,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 0 states have call successors, (0), 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:11:56,434 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:11:56,434 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:11:56,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 19:11:56,435 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-07 19:11:56,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:11:56,435 INFO L85 PathProgramCache]: Analyzing trace with hash 761192616, now seen corresponding path program 1 times [2024-11-07 19:11:56,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:11:56,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714117255] [2024-11-07 19:11:56,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:11:56,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:11:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:11:57,195 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:11:57,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:11:57,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714117255] [2024-11-07 19:11:57,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714117255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:11:57,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:11:57,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 19:11:57,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974540820] [2024-11-07 19:11:57,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:11:57,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 19:11:57,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:11:57,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 19:11:57,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:11:57,219 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54 [2024-11-07 19:11:57,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 249 flow. Second operand has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:11:57,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:11:57,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54 [2024-11-07 19:11:57,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:11:58,061 INFO L124 PetriNetUnfolderBase]: 4945/7765 cut-off events. [2024-11-07 19:11:58,061 INFO L125 PetriNetUnfolderBase]: For 3278/3488 co-relation queries the response was YES. [2024-11-07 19:11:58,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17951 conditions, 7765 events. 4945/7765 cut-off events. For 3278/3488 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 49118 event pairs, 1086 based on Foata normal form. 16/7505 useless extension candidates. Maximal degree in co-relation 17938. Up to 3708 conditions per place. [2024-11-07 19:11:58,095 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 41 selfloop transitions, 5 changer transitions 44/117 dead transitions. [2024-11-07 19:11:58,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 117 transitions, 579 flow [2024-11-07 19:11:58,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 19:11:58,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 19:11:58,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 251 transitions. [2024-11-07 19:11:58,096 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5810185185185185 [2024-11-07 19:11:58,097 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 249 flow. Second operand 8 states and 251 transitions. [2024-11-07 19:11:58,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 117 transitions, 579 flow [2024-11-07 19:11:58,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 117 transitions, 473 flow, removed 22 selfloop flow, removed 10 redundant places. [2024-11-07 19:11:58,136 INFO L231 Difference]: Finished difference. Result has 71 places, 58 transitions, 196 flow [2024-11-07 19:11:58,137 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=196, PETRI_PLACES=71, PETRI_TRANSITIONS=58} [2024-11-07 19:11:58,138 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 10 predicate places. [2024-11-07 19:11:58,138 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 58 transitions, 196 flow [2024-11-07 19:11:58,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:11:58,138 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:11:58,138 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:11:58,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 19:11:58,138 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-07 19:11:58,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:11:58,140 INFO L85 PathProgramCache]: Analyzing trace with hash 2134451952, now seen corresponding path program 2 times [2024-11-07 19:11:58,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:11:58,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976945110] [2024-11-07 19:11:58,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:11:58,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:11:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:11:58,426 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:11:58,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:11:58,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976945110] [2024-11-07 19:11:58,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976945110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:11:58,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:11:58,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:11:58,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237707399] [2024-11-07 19:11:58,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:11:58,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:11:58,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:11:58,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:11:58,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:11:58,439 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 54 [2024-11-07 19:11:58,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 58 transitions, 196 flow. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 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:11:58,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:11:58,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 54 [2024-11-07 19:11:58,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:11:58,865 INFO L124 PetriNetUnfolderBase]: 3333/5622 cut-off events. [2024-11-07 19:11:58,865 INFO L125 PetriNetUnfolderBase]: For 1699/1705 co-relation queries the response was YES. [2024-11-07 19:11:58,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12801 conditions, 5622 events. 3333/5622 cut-off events. For 1699/1705 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 38663 event pairs, 778 based on Foata normal form. 16/5296 useless extension candidates. Maximal degree in co-relation 12787. Up to 1900 conditions per place. [2024-11-07 19:11:58,885 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 33 selfloop transitions, 1 changer transitions 27/91 dead transitions. [2024-11-07 19:11:58,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 91 transitions, 408 flow [2024-11-07 19:11:58,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:11:58,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:11:58,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2024-11-07 19:11:58,887 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6018518518518519 [2024-11-07 19:11:58,887 INFO L175 Difference]: Start difference. First operand has 71 places, 58 transitions, 196 flow. Second operand 6 states and 195 transitions. [2024-11-07 19:11:58,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 91 transitions, 408 flow [2024-11-07 19:11:58,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 91 transitions, 398 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-11-07 19:11:58,891 INFO L231 Difference]: Finished difference. Result has 73 places, 57 transitions, 198 flow [2024-11-07 19:11:58,891 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=198, PETRI_PLACES=73, PETRI_TRANSITIONS=57} [2024-11-07 19:11:58,892 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 12 predicate places. [2024-11-07 19:11:58,892 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 57 transitions, 198 flow [2024-11-07 19:11:58,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 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:11:58,892 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:11:58,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:11:58,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 19:11:58,892 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-07 19:11:58,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:11:58,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1751082370, now seen corresponding path program 3 times [2024-11-07 19:11:58,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:11:58,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102197382] [2024-11-07 19:11:58,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:11:58,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:11:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:12:00,972 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:12:00,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:12:00,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102197382] [2024-11-07 19:12:00,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102197382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:12:00,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:12:00,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 19:12:00,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959372024] [2024-11-07 19:12:00,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:12:00,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 19:12:00,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:12:00,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 19:12:00,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-07 19:12:00,987 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 54 [2024-11-07 19:12:00,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 57 transitions, 198 flow. Second operand has 12 states, 12 states have (on average 25.666666666666668) internal successors, (308), 12 states have internal predecessors, (308), 0 states have call successors, (0), 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:12:00,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:12:00,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 54 [2024-11-07 19:12:00,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:12:01,655 INFO L124 PetriNetUnfolderBase]: 4113/6968 cut-off events. [2024-11-07 19:12:01,656 INFO L125 PetriNetUnfolderBase]: For 822/878 co-relation queries the response was YES. [2024-11-07 19:12:01,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15008 conditions, 6968 events. 4113/6968 cut-off events. For 822/878 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 48619 event pairs, 1486 based on Foata normal form. 30/6381 useless extension candidates. Maximal degree in co-relation 14992. Up to 1799 conditions per place. [2024-11-07 19:12:01,681 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 51 selfloop transitions, 7 changer transitions 21/111 dead transitions. [2024-11-07 19:12:01,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 111 transitions, 494 flow [2024-11-07 19:12:01,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 19:12:01,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-07 19:12:01,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 247 transitions. [2024-11-07 19:12:01,682 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6534391534391535 [2024-11-07 19:12:01,682 INFO L175 Difference]: Start difference. First operand has 73 places, 57 transitions, 198 flow. Second operand 7 states and 247 transitions. [2024-11-07 19:12:01,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 111 transitions, 494 flow [2024-11-07 19:12:01,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 111 transitions, 477 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-11-07 19:12:01,685 INFO L231 Difference]: Finished difference. Result has 77 places, 61 transitions, 243 flow [2024-11-07 19:12:01,685 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=243, PETRI_PLACES=77, PETRI_TRANSITIONS=61} [2024-11-07 19:12:01,686 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 16 predicate places. [2024-11-07 19:12:01,686 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 61 transitions, 243 flow [2024-11-07 19:12:01,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 25.666666666666668) internal successors, (308), 12 states have internal predecessors, (308), 0 states have call successors, (0), 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:12:01,686 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:12:01,686 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:12:01,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 19:12:01,687 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-07 19:12:01,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:12:01,687 INFO L85 PathProgramCache]: Analyzing trace with hash 2065225348, now seen corresponding path program 4 times [2024-11-07 19:12:01,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:12:01,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747373118] [2024-11-07 19:12:01,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:12:01,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:12:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:12:01,988 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:12:01,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:12:01,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747373118] [2024-11-07 19:12:01,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747373118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:12:01,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:12:01,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:12:01,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857792460] [2024-11-07 19:12:01,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:12:01,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:12:01,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:12:01,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:12:01,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:12:01,999 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 54 [2024-11-07 19:12:02,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 61 transitions, 243 flow. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 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:12:02,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:12:02,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 54 [2024-11-07 19:12:02,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:12:02,461 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([414] L756-->L763: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_51 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0)))) (let ((.cse0 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_52 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_43 256) 0))))) (and (= (ite (= (mod (ite .cse0 0 v_~x$r_buff0_thd1~0_22) 256) 0) 0 1) v_~x$r_buff0_thd1~0_21) (= v_~x$r_buff1_thd1~0_19 (ite (= (mod (ite (or (and (not (= (mod v_~x$w_buff1_used~0_42 256) 0)) .cse1) (and .cse2 (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)))) 0 v_~x$r_buff1_thd1~0_20) 256) 0) 0 1)) (= v_~x$w_buff1_used~0_42 (ite (= (mod (ite (or .cse3 .cse0) 0 v_~x$w_buff1_used~0_43) 256) 0) 0 1)) (= v_~x$w_buff0_used~0_51 (ite (= (mod (ite .cse4 0 v_~x$w_buff0_used~0_52) 256) 0) 0 1)) (= (ite .cse4 v_~x$w_buff0~0_12 (ite .cse3 v_~x$w_buff1~0_11 v_~x~0_20)) v_~x~0_19)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_12, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_11, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_43, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_52} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_12, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_11, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_51} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][32], [60#true, 161#true, 44#L826true, 73#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 41#L860-4true, 62#true, 66#true, 50#L783true, 117#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 132#(and (or (not (= 2 ~x$w_buff0~0)) (= (mod ~x$w_buff0_used~0 256) 0) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= (mod ~x$r_buff0_thd0~0 256) 0)) (or (and (not (= (mod ~x$w_buff0_used~0 256) 0)) (not (= (mod ~x$r_buff0_thd0~0 256) 0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (mod ~x$r_buff1_thd0~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0)) (not (= (mod ~x$w_buff1_used~0 256) 0)))) (or (= (mod ~x$w_buff0_used~0 256) 0) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= (mod ~x$r_buff1_thd0~0 256) 0) (not (= ~__unbuffered_p2_EAX~0 0)) (= (mod ~x$w_buff1_used~0 256) 0) (not (= 2 ~x$w_buff1~0))))) (= ~a~0 1)), Black: 128#(and (or (not (= 2 ~x$w_buff0~0)) (= (mod ~x$w_buff0_used~0 256) 0) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= (mod ~x$r_buff0_thd0~0 256) 0)) (or (and (not (= (mod ~x$w_buff0_used~0 256) 0)) (not (= (mod ~x$r_buff0_thd0~0 256) 0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (mod ~x$r_buff1_thd0~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0)) (not (= (mod ~x$w_buff1_used~0 256) 0)))) (or (= (mod ~x$w_buff0_used~0 256) 0) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= (mod ~x$r_buff1_thd0~0 256) 0) (not (= ~__unbuffered_p2_EAX~0 0)) (= (mod ~x$w_buff1_used~0 256) 0) (not (= 2 ~x$w_buff1~0)))))), 40#P2EXITtrue, 147#(= ~z~0 1), Black: 164#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd4~0 0) (not (= (mod ~x$w_buff0_used~0 256) 0)) (= 1 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 180#(and (<= 1 ~main$tmp_guard1~0) (= ~x$w_buff1_used~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd4~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 176#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd4~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 174#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd4~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd4~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), 64#true, 45#L763true, 126#(= ~a~0 1), 188#(= ~y~0 1)]) [2024-11-07 19:12:02,461 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-11-07 19:12:02,462 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-07 19:12:02,462 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-07 19:12:02,462 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-07 19:12:02,512 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([414] L756-->L763: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_51 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0)))) (let ((.cse0 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_52 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_43 256) 0))))) (and (= (ite (= (mod (ite .cse0 0 v_~x$r_buff0_thd1~0_22) 256) 0) 0 1) v_~x$r_buff0_thd1~0_21) (= v_~x$r_buff1_thd1~0_19 (ite (= (mod (ite (or (and (not (= (mod v_~x$w_buff1_used~0_42 256) 0)) .cse1) (and .cse2 (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)))) 0 v_~x$r_buff1_thd1~0_20) 256) 0) 0 1)) (= v_~x$w_buff1_used~0_42 (ite (= (mod (ite (or .cse3 .cse0) 0 v_~x$w_buff1_used~0_43) 256) 0) 0 1)) (= v_~x$w_buff0_used~0_51 (ite (= (mod (ite .cse4 0 v_~x$w_buff0_used~0_52) 256) 0) 0 1)) (= (ite .cse4 v_~x$w_buff0~0_12 (ite .cse3 v_~x$w_buff1~0_11 v_~x~0_20)) v_~x~0_19)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_12, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_11, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_43, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_52} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_12, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_11, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_51} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][32], [60#true, 161#true, 44#L826true, 29#L861true, 73#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 50#L783true, 62#true, 66#true, 117#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 132#(and (or (not (= 2 ~x$w_buff0~0)) (= (mod ~x$w_buff0_used~0 256) 0) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= (mod ~x$r_buff0_thd0~0 256) 0)) (or (and (not (= (mod ~x$w_buff0_used~0 256) 0)) (not (= (mod ~x$r_buff0_thd0~0 256) 0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (mod ~x$r_buff1_thd0~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0)) (not (= (mod ~x$w_buff1_used~0 256) 0)))) (or (= (mod ~x$w_buff0_used~0 256) 0) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= (mod ~x$r_buff1_thd0~0 256) 0) (not (= ~__unbuffered_p2_EAX~0 0)) (= (mod ~x$w_buff1_used~0 256) 0) (not (= 2 ~x$w_buff1~0))))) (= ~a~0 1)), Black: 128#(and (or (not (= 2 ~x$w_buff0~0)) (= (mod ~x$w_buff0_used~0 256) 0) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= (mod ~x$r_buff0_thd0~0 256) 0)) (or (and (not (= (mod ~x$w_buff0_used~0 256) 0)) (not (= (mod ~x$r_buff0_thd0~0 256) 0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (mod ~x$r_buff1_thd0~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0)) (not (= (mod ~x$w_buff1_used~0 256) 0)))) (or (= (mod ~x$w_buff0_used~0 256) 0) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= (mod ~x$r_buff1_thd0~0 256) 0) (not (= ~__unbuffered_p2_EAX~0 0)) (= (mod ~x$w_buff1_used~0 256) 0) (not (= 2 ~x$w_buff1~0)))))), 40#P2EXITtrue, 147#(= ~z~0 1), Black: 164#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd4~0 0) (not (= (mod ~x$w_buff0_used~0 256) 0)) (= 1 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 180#(and (<= 1 ~main$tmp_guard1~0) (= ~x$w_buff1_used~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd4~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 176#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd4~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 174#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd4~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd4~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), 64#true, 45#L763true, 126#(= ~a~0 1), 188#(= ~y~0 1)]) [2024-11-07 19:12:02,512 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-07 19:12:02,512 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-07 19:12:02,512 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-07 19:12:02,512 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-07 19:12:02,514 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([414] L756-->L763: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_51 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0)))) (let ((.cse0 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_52 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_43 256) 0))))) (and (= (ite (= (mod (ite .cse0 0 v_~x$r_buff0_thd1~0_22) 256) 0) 0 1) v_~x$r_buff0_thd1~0_21) (= v_~x$r_buff1_thd1~0_19 (ite (= (mod (ite (or (and (not (= (mod v_~x$w_buff1_used~0_42 256) 0)) .cse1) (and .cse2 (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)))) 0 v_~x$r_buff1_thd1~0_20) 256) 0) 0 1)) (= v_~x$w_buff1_used~0_42 (ite (= (mod (ite (or .cse3 .cse0) 0 v_~x$w_buff1_used~0_43) 256) 0) 0 1)) (= v_~x$w_buff0_used~0_51 (ite (= (mod (ite .cse4 0 v_~x$w_buff0_used~0_52) 256) 0) 0 1)) (= (ite .cse4 v_~x$w_buff0~0_12 (ite .cse3 v_~x$w_buff1~0_11 v_~x~0_20)) v_~x~0_19)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_12, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_11, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_43, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_52} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_12, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_11, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_51} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][40], [60#true, 161#true, 193#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 44#L826true, 73#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 41#L860-4true, 62#true, 66#true, 117#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 132#(and (or (not (= 2 ~x$w_buff0~0)) (= (mod ~x$w_buff0_used~0 256) 0) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= (mod ~x$r_buff0_thd0~0 256) 0)) (or (and (not (= (mod ~x$w_buff0_used~0 256) 0)) (not (= (mod ~x$r_buff0_thd0~0 256) 0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (mod ~x$r_buff1_thd0~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0)) (not (= (mod ~x$w_buff1_used~0 256) 0)))) (or (= (mod ~x$w_buff0_used~0 256) 0) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= (mod ~x$r_buff1_thd0~0 256) 0) (not (= ~__unbuffered_p2_EAX~0 0)) (= (mod ~x$w_buff1_used~0 256) 0) (not (= 2 ~x$w_buff1~0))))) (= ~a~0 1)), Black: 128#(and (or (not (= 2 ~x$w_buff0~0)) (= (mod ~x$w_buff0_used~0 256) 0) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= (mod ~x$r_buff0_thd0~0 256) 0)) (or (and (not (= (mod ~x$w_buff0_used~0 256) 0)) (not (= (mod ~x$r_buff0_thd0~0 256) 0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (mod ~x$r_buff1_thd0~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0)) (not (= (mod ~x$w_buff1_used~0 256) 0)))) (or (= (mod ~x$w_buff0_used~0 256) 0) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= (mod ~x$r_buff1_thd0~0 256) 0) (not (= ~__unbuffered_p2_EAX~0 0)) (= (mod ~x$w_buff1_used~0 256) 0) (not (= 2 ~x$w_buff1~0)))))), 40#P2EXITtrue, 147#(= ~z~0 1), Black: 164#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd4~0 0) (not (= (mod ~x$w_buff0_used~0 256) 0)) (= 1 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 180#(and (<= 1 ~main$tmp_guard1~0) (= ~x$w_buff1_used~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd4~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 176#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd4~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 174#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd4~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd4~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), 64#true, 58#L786true, 45#L763true, 126#(= ~a~0 1)]) [2024-11-07 19:12:02,514 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-07 19:12:02,514 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-07 19:12:02,514 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-07 19:12:02,514 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-07 19:12:02,630 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([414] L756-->L763: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_51 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0)))) (let ((.cse0 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_52 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_43 256) 0))))) (and (= (ite (= (mod (ite .cse0 0 v_~x$r_buff0_thd1~0_22) 256) 0) 0 1) v_~x$r_buff0_thd1~0_21) (= v_~x$r_buff1_thd1~0_19 (ite (= (mod (ite (or (and (not (= (mod v_~x$w_buff1_used~0_42 256) 0)) .cse1) (and .cse2 (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)))) 0 v_~x$r_buff1_thd1~0_20) 256) 0) 0 1)) (= v_~x$w_buff1_used~0_42 (ite (= (mod (ite (or .cse3 .cse0) 0 v_~x$w_buff1_used~0_43) 256) 0) 0 1)) (= v_~x$w_buff0_used~0_51 (ite (= (mod (ite .cse4 0 v_~x$w_buff0_used~0_52) 256) 0) 0 1)) (= (ite .cse4 v_~x$w_buff0~0_12 (ite .cse3 v_~x$w_buff1~0_11 v_~x~0_20)) v_~x~0_19)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_12, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_11, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_43, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_52} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_12, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_11, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_51} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][40], [60#true, 161#true, 193#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 44#L826true, 29#L861true, 73#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 62#true, 66#true, 117#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 132#(and (or (not (= 2 ~x$w_buff0~0)) (= (mod ~x$w_buff0_used~0 256) 0) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= (mod ~x$r_buff0_thd0~0 256) 0)) (or (and (not (= (mod ~x$w_buff0_used~0 256) 0)) (not (= (mod ~x$r_buff0_thd0~0 256) 0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (mod ~x$r_buff1_thd0~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0)) (not (= (mod ~x$w_buff1_used~0 256) 0)))) (or (= (mod ~x$w_buff0_used~0 256) 0) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= (mod ~x$r_buff1_thd0~0 256) 0) (not (= ~__unbuffered_p2_EAX~0 0)) (= (mod ~x$w_buff1_used~0 256) 0) (not (= 2 ~x$w_buff1~0))))) (= ~a~0 1)), Black: 128#(and (or (not (= 2 ~x$w_buff0~0)) (= (mod ~x$w_buff0_used~0 256) 0) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= (mod ~x$r_buff0_thd0~0 256) 0)) (or (and (not (= (mod ~x$w_buff0_used~0 256) 0)) (not (= (mod ~x$r_buff0_thd0~0 256) 0))) (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (mod ~x$r_buff1_thd0~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0)) (not (= (mod ~x$w_buff1_used~0 256) 0)))) (or (= (mod ~x$w_buff0_used~0 256) 0) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= (mod ~x$r_buff1_thd0~0 256) 0) (not (= ~__unbuffered_p2_EAX~0 0)) (= (mod ~x$w_buff1_used~0 256) 0) (not (= 2 ~x$w_buff1~0)))))), 40#P2EXITtrue, 147#(= ~z~0 1), Black: 164#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd4~0 0) (not (= (mod ~x$w_buff0_used~0 256) 0)) (= 1 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 180#(and (<= 1 ~main$tmp_guard1~0) (= ~x$w_buff1_used~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd4~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 176#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd4~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 174#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd4~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd4~0) (= ~x$r_buff1_thd4~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), 64#true, 45#L763true, 58#L786true, 126#(= ~a~0 1)]) [2024-11-07 19:12:02,630 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-11-07 19:12:02,630 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-07 19:12:02,630 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-07 19:12:02,630 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-07 19:12:03,117 INFO L124 PetriNetUnfolderBase]: 8044/13611 cut-off events. [2024-11-07 19:12:03,117 INFO L125 PetriNetUnfolderBase]: For 5527/5715 co-relation queries the response was YES. [2024-11-07 19:12:03,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31757 conditions, 13611 events. 8044/13611 cut-off events. For 5527/5715 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 106652 event pairs, 3044 based on Foata normal form. 48/12537 useless extension candidates. Maximal degree in co-relation 31738. Up to 5180 conditions per place. [2024-11-07 19:12:03,180 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 29 selfloop transitions, 1 changer transitions 39/99 dead transitions. [2024-11-07 19:12:03,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 99 transitions, 498 flow [2024-11-07 19:12:03,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:12:03,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:12:03,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2024-11-07 19:12:03,182 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2024-11-07 19:12:03,182 INFO L175 Difference]: Start difference. First operand has 77 places, 61 transitions, 243 flow. Second operand 6 states and 198 transitions. [2024-11-07 19:12:03,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 99 transitions, 498 flow [2024-11-07 19:12:03,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 99 transitions, 488 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-07 19:12:03,187 INFO L231 Difference]: Finished difference. Result has 81 places, 57 transitions, 215 flow [2024-11-07 19:12:03,187 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=215, PETRI_PLACES=81, PETRI_TRANSITIONS=57} [2024-11-07 19:12:03,188 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 20 predicate places. [2024-11-07 19:12:03,188 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 57 transitions, 215 flow [2024-11-07 19:12:03,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 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:12:03,188 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:12:03,188 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:12:03,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 19:12:03,188 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-07 19:12:03,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:12:03,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1702021322, now seen corresponding path program 5 times [2024-11-07 19:12:03,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:12:03,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115619906] [2024-11-07 19:12:03,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:12:03,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:12:03,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:12:03,240 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:12:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:12:03,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 19:12:03,319 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:12:03,320 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-07 19:12:03,321 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-07 19:12:03,321 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-07 19:12:03,321 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-07 19:12:03,321 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-07 19:12:03,321 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-07 19:12:03,322 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-07 19:12:03,322 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-07 19:12:03,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 19:12:03,322 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2024-11-07 19:12:03,379 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 19:12:03,379 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 19:12:03,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:12:03 BasicIcfg [2024-11-07 19:12:03,385 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 19:12:03,386 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 19:12:03,386 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 19:12:03,386 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 19:12:03,387 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:11:49" (3/4) ... [2024-11-07 19:12:03,388 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 19:12:03,388 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 19:12:03,390 INFO L158 Benchmark]: Toolchain (without parser) took 15020.06ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 91.1MB in the beginning and 818.6MB in the end (delta: -727.6MB). Peak memory consumption was 622.9MB. Max. memory is 16.1GB. [2024-11-07 19:12:03,390 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 117.4MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:12:03,390 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.80ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 67.1MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 19:12:03,391 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.78ms. Allocated memory is still 117.4MB. Free memory was 67.1MB in the beginning and 64.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:12:03,391 INFO L158 Benchmark]: Boogie Preprocessor took 46.17ms. Allocated memory is still 117.4MB. Free memory was 64.4MB in the beginning and 61.1MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 19:12:03,392 INFO L158 Benchmark]: RCFGBuilder took 707.27ms. Allocated memory is still 117.4MB. Free memory was 61.1MB in the beginning and 49.7MB in the end (delta: 11.5MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2024-11-07 19:12:03,392 INFO L158 Benchmark]: TraceAbstraction took 13742.83ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 48.7MB in the beginning and 818.9MB in the end (delta: -770.2MB). Peak memory consumption was 583.8MB. Max. memory is 16.1GB. [2024-11-07 19:12:03,393 INFO L158 Benchmark]: Witness Printer took 2.47ms. Allocated memory is still 1.5GB. Free memory was 818.9MB in the beginning and 818.6MB in the end (delta: 244.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:12:03,394 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48ms. Allocated memory is still 117.4MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 470.80ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 67.1MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.78ms. Allocated memory is still 117.4MB. Free memory was 67.1MB in the beginning and 64.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.17ms. Allocated memory is still 117.4MB. Free memory was 64.4MB in the beginning and 61.1MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 707.27ms. Allocated memory is still 117.4MB. Free memory was 61.1MB in the beginning and 49.7MB in the end (delta: 11.5MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * TraceAbstraction took 13742.83ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 48.7MB in the beginning and 818.9MB in the end (delta: -770.2MB). Peak memory consumption was 583.8MB. Max. memory is 16.1GB. * Witness Printer took 2.47ms. Allocated memory is still 1.5GB. Free memory was 818.9MB in the beginning and 818.6MB in the end (delta: 244.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L853] 0 pthread_t t489; [L854] FCALL, FORK 0 pthread_create(&t489, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t489=-3, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L855] 0 pthread_t t490; [L856] FCALL, FORK 0 pthread_create(&t490, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t489=-3, t490=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L857] 0 pthread_t t491; [L858] FCALL, FORK 0 pthread_create(&t491, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t489=-3, t490=-2, t491=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L859] 0 pthread_t t492; [L785] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L860] FCALL, FORK 0 pthread_create(&t492, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t489=-3, t490=-2, t491=-1, t492=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L802] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L822] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L825] 4 __unbuffered_p3_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L828] 4 __unbuffered_p3_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L752] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L755] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L831] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L832] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L833] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L834] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L835] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L838] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t489=-3, t490=-2, t491=-1, t492=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L867] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L868] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L869] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L870] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t489=-3, t490=-2, t491=-1, t492=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L873] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L874] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L875] 0 x$flush_delayed = weak$$choice2 [L876] 0 x$mem_tmp = x [L877] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L878] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L879] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L880] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L881] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L883] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L884] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L885] 0 x = x$flush_delayed ? x$mem_tmp : x [L886] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t489=-3, t490=-2, t491=-1, t492=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix018_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 87 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 672 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 637 mSDsluCounter, 187 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 164 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1507 IncrementalHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 23 mSDtfsCounter, 1507 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=249occurred in iteration=6, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 311 NumberOfCodeBlocks, 311 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 263 ConstructedInterpolants, 0 QuantifiedInterpolants, 1493 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 19:12:03,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3bc57c42fd552df471a50a3f823d776d12ae5a02a1da1686aaab749af4f270bf --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:12:05,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:12:05,981 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-07 19:12:05,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:12:05,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:12:06,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:12:06,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:12:06,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:12:06,016 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:12:06,016 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:12:06,017 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:12:06,017 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:12:06,017 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:12:06,017 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:12:06,018 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:12:06,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:12:06,018 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:12:06,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:12:06,018 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:12:06,018 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:12:06,018 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 19:12:06,018 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 19:12:06,018 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 19:12:06,018 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:12:06,018 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:12:06,018 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 19:12:06,018 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:12:06,018 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 19:12:06,018 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:12:06,018 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:12:06,018 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:12:06,018 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:12:06,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:12:06,019 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:12:06,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:12:06,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:12:06,019 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:12:06,019 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:12:06,019 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 19:12:06,019 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 19:12:06,019 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:12:06,019 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:12:06,019 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:12:06,019 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:12:06,019 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 -> 3bc57c42fd552df471a50a3f823d776d12ae5a02a1da1686aaab749af4f270bf [2024-11-07 19:12:06,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:12:06,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:12:06,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:12:06,320 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:12:06,320 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:12:06,321 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i [2024-11-07 19:12:07,551 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:12:07,815 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:12:07,816 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i [2024-11-07 19:12:07,832 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d5db2820/f72d8f088b094af7a41328e466eb803c/FLAG64b930f76 [2024-11-07 19:12:08,119 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d5db2820/f72d8f088b094af7a41328e466eb803c [2024-11-07 19:12:08,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:12:08,122 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:12:08,123 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:12:08,123 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:12:08,126 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:12:08,126 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:12:08" (1/1) ... [2024-11-07 19:12:08,127 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4406650c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:12:08, skipping insertion in model container [2024-11-07 19:12:08,127 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:12:08" (1/1) ... [2024-11-07 19:12:08,156 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:12:08,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:12:08,411 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:12:08,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:12:08,502 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:12:08,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:12:08 WrapperNode [2024-11-07 19:12:08,503 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:12:08,504 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:12:08,504 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:12:08,504 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:12:08,511 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:12:08" (1/1) ... [2024-11-07 19:12:08,533 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:12:08" (1/1) ... [2024-11-07 19:12:08,550 INFO L138 Inliner]: procedures = 177, calls = 54, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 152 [2024-11-07 19:12:08,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:12:08,551 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:12:08,551 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:12:08,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:12:08,559 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:12:08" (1/1) ... [2024-11-07 19:12:08,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:12:08" (1/1) ... [2024-11-07 19:12:08,563 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:12:08" (1/1) ... [2024-11-07 19:12:08,588 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 19:12:08,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:12:08" (1/1) ... [2024-11-07 19:12:08,588 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:12:08" (1/1) ... [2024-11-07 19:12:08,602 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:12:08" (1/1) ... [2024-11-07 19:12:08,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:12:08" (1/1) ... [2024-11-07 19:12:08,614 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:12:08" (1/1) ... [2024-11-07 19:12:08,615 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:12:08" (1/1) ... [2024-11-07 19:12:08,618 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:12:08,618 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:12:08,618 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:12:08,618 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:12:08,623 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:12:08" (1/1) ... [2024-11-07 19:12:08,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:12:08,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:12:08,661 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:12:08,667 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:12:08,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-07 19:12:08,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:12:08,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 19:12:08,689 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-07 19:12:08,689 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-07 19:12:08,689 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-07 19:12:08,689 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-07 19:12:08,690 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-07 19:12:08,690 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-07 19:12:08,690 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-07 19:12:08,690 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-07 19:12:08,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-07 19:12:08,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:12:08,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:12:08,691 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:12:08,816 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:12:08,817 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:12:09,208 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 19:12:09,209 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:12:09,440 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:12:09,440 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 19:12:09,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:12:09 BoogieIcfgContainer [2024-11-07 19:12:09,441 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:12:09,443 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:12:09,443 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:12:09,450 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:12:09,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:12:08" (1/3) ... [2024-11-07 19:12:09,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bee5923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:12:09, skipping insertion in model container [2024-11-07 19:12:09,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:12:08" (2/3) ... [2024-11-07 19:12:09,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bee5923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:12:09, skipping insertion in model container [2024-11-07 19:12:09,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:12:09" (3/3) ... [2024-11-07 19:12:09,453 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018_tso.oepc.i [2024-11-07 19:12:09,486 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:12:09,487 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-07 19:12:09,487 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 19:12:09,539 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 19:12:09,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 54 transitions, 124 flow [2024-11-07 19:12:09,595 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2024-11-07 19:12:09,598 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:12:09,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 50 events. 2/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 101 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2024-11-07 19:12:09,604 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 54 transitions, 124 flow [2024-11-07 19:12:09,606 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 50 transitions, 112 flow [2024-11-07 19:12:09,613 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:12:09,624 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;@c65ef06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:12:09,626 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-07 19:12:09,631 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:12:09,631 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-11-07 19:12:09,632 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:12:09,632 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:12:09,632 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 19:12:09,633 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-07 19:12:09,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:12:09,637 INFO L85 PathProgramCache]: Analyzing trace with hash -436919978, now seen corresponding path program 1 times [2024-11-07 19:12:09,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:12:09,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64571122] [2024-11-07 19:12:09,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:12:09,646 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:12:09,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:12:09,648 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:12:09,650 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:12:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:12:09,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 19:12:09,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:12:09,766 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:12:09,766 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:12:09,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:12:09,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64571122] [2024-11-07 19:12:09,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64571122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:12:09,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:12:09,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:12:09,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784324954] [2024-11-07 19:12:09,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:12:09,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:12:09,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:12:09,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:12:09,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:12:09,794 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-11-07 19:12:09,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:12:09,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:12:09,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-11-07 19:12:09,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:12:10,611 INFO L124 PetriNetUnfolderBase]: 2754/4562 cut-off events. [2024-11-07 19:12:10,611 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-11-07 19:12:10,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8501 conditions, 4562 events. 2754/4562 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 32088 event pairs, 492 based on Foata normal form. 216/4703 useless extension candidates. Maximal degree in co-relation 8489. Up to 3064 conditions per place. [2024-11-07 19:12:10,647 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 39 selfloop transitions, 2 changer transitions 2/64 dead transitions. [2024-11-07 19:12:10,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 64 transitions, 232 flow [2024-11-07 19:12:10,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:12:10,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:12:10,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2024-11-07 19:12:10,659 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7592592592592593 [2024-11-07 19:12:10,659 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 123 transitions. [2024-11-07 19:12:10,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 64 transitions, 232 flow [2024-11-07 19:12:10,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 64 transitions, 226 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 19:12:10,667 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 102 flow [2024-11-07 19:12:10,669 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2024-11-07 19:12:10,671 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2024-11-07 19:12:10,672 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 102 flow [2024-11-07 19:12:10,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:12:10,672 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:12:10,672 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:12:10,675 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:12:10,873 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:12:10,874 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-07 19:12:10,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:12:10,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1084553717, now seen corresponding path program 1 times [2024-11-07 19:12:10,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:12:10,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [750673943] [2024-11-07 19:12:10,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:12:10,876 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:12:10,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:12:10,880 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:12:10,882 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:12:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:12:10,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:12:10,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:12:10,994 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:12:10,994 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:12:10,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:12:10,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [750673943] [2024-11-07 19:12:10,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [750673943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:12:10,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:12:10,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:12:10,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694261883] [2024-11-07 19:12:10,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:12:10,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:12:10,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:12:10,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:12:10,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:12:11,006 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54 [2024-11-07 19:12:11,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:12:11,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:12:11,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54 [2024-11-07 19:12:11,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:12:12,443 INFO L124 PetriNetUnfolderBase]: 8909/13407 cut-off events. [2024-11-07 19:12:12,444 INFO L125 PetriNetUnfolderBase]: For 624/624 co-relation queries the response was YES. [2024-11-07 19:12:12,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26395 conditions, 13407 events. 8909/13407 cut-off events. For 624/624 co-relation queries the response was YES. Maximal size of possible extension queue 792. Compared 93326 event pairs, 869 based on Foata normal form. 320/13464 useless extension candidates. Maximal degree in co-relation 26385. Up to 8233 conditions per place. [2024-11-07 19:12:12,492 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 52 selfloop transitions, 6 changer transitions 1/75 dead transitions. [2024-11-07 19:12:12,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 75 transitions, 290 flow [2024-11-07 19:12:12,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:12:12,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:12:12,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2024-11-07 19:12:12,493 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6527777777777778 [2024-11-07 19:12:12,494 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 4 states and 141 transitions. [2024-11-07 19:12:12,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 75 transitions, 290 flow [2024-11-07 19:12:12,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 75 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:12:12,496 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 140 flow [2024-11-07 19:12:12,496 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2024-11-07 19:12:12,497 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -2 predicate places. [2024-11-07 19:12:12,497 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 140 flow [2024-11-07 19:12:12,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:12:12,497 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:12:12,497 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:12:12,501 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:12:12,700 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:12:12,700 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-07 19:12:12,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:12:12,701 INFO L85 PathProgramCache]: Analyzing trace with hash -478088314, now seen corresponding path program 1 times [2024-11-07 19:12:12,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:12:12,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1636398701] [2024-11-07 19:12:12,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:12:12,702 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:12:12,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:12:12,703 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:12:12,705 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:12:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:12:12,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 19:12:12,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:12:12,800 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:12:12,801 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:12:12,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:12:12,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1636398701] [2024-11-07 19:12:12,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1636398701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:12:12,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:12:12,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:12:12,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671775855] [2024-11-07 19:12:12,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:12:12,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:12:12,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:12:12,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:12:12,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:12:12,807 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54 [2024-11-07 19:12:12,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 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:12:12,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:12:12,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54 [2024-11-07 19:12:12,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:12:13,539 INFO L124 PetriNetUnfolderBase]: 6745/10251 cut-off events. [2024-11-07 19:12:13,539 INFO L125 PetriNetUnfolderBase]: For 2392/2392 co-relation queries the response was YES. [2024-11-07 19:12:13,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22933 conditions, 10251 events. 6745/10251 cut-off events. For 2392/2392 co-relation queries the response was YES. Maximal size of possible extension queue 596. Compared 68087 event pairs, 369 based on Foata normal form. 296/10345 useless extension candidates. Maximal degree in co-relation 22921. Up to 5461 conditions per place. [2024-11-07 19:12:13,570 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 66 selfloop transitions, 10 changer transitions 1/93 dead transitions. [2024-11-07 19:12:13,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 93 transitions, 411 flow [2024-11-07 19:12:13,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:12:13,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:12:13,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 179 transitions. [2024-11-07 19:12:13,575 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.662962962962963 [2024-11-07 19:12:13,575 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 140 flow. Second operand 5 states and 179 transitions. [2024-11-07 19:12:13,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 93 transitions, 411 flow [2024-11-07 19:12:13,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 93 transitions, 400 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-07 19:12:13,578 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 192 flow [2024-11-07 19:12:13,582 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=192, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2024-11-07 19:12:13,583 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 2 predicate places. [2024-11-07 19:12:13,583 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 192 flow [2024-11-07 19:12:13,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 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:12:13,583 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:12:13,583 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:12:13,590 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:12:13,783 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:12:13,784 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-07 19:12:13,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:12:13,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1376027479, now seen corresponding path program 1 times [2024-11-07 19:12:13,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:12:13,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [814538443] [2024-11-07 19:12:13,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:12:13,785 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:12:13,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:12:13,787 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:12:13,789 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:12:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:12:13,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 19:12:13,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:12:13,978 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:12:13,980 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:12:13,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:12:13,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [814538443] [2024-11-07 19:12:13,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [814538443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:12:13,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:12:13,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:12:13,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141723957] [2024-11-07 19:12:13,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:12:13,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:12:13,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:12:13,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:12:13,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:12:13,997 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54 [2024-11-07 19:12:13,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 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:12:13,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:12:13,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54 [2024-11-07 19:12:13,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:12:14,734 INFO L124 PetriNetUnfolderBase]: 4037/6135 cut-off events. [2024-11-07 19:12:14,734 INFO L125 PetriNetUnfolderBase]: For 4377/4377 co-relation queries the response was YES. [2024-11-07 19:12:14,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15387 conditions, 6135 events. 4037/6135 cut-off events. For 4377/4377 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 35879 event pairs, 221 based on Foata normal form. 208/6176 useless extension candidates. Maximal degree in co-relation 15373. Up to 2101 conditions per place. [2024-11-07 19:12:14,763 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 78 selfloop transitions, 14 changer transitions 1/109 dead transitions. [2024-11-07 19:12:14,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 109 transitions, 538 flow [2024-11-07 19:12:14,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:12:14,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:12:14,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 215 transitions. [2024-11-07 19:12:14,765 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6635802469135802 [2024-11-07 19:12:14,765 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 192 flow. Second operand 6 states and 215 transitions. [2024-11-07 19:12:14,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 109 transitions, 538 flow [2024-11-07 19:12:14,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 109 transitions, 508 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-07 19:12:14,779 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 242 flow [2024-11-07 19:12:14,779 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=242, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2024-11-07 19:12:14,780 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 5 predicate places. [2024-11-07 19:12:14,780 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 242 flow [2024-11-07 19:12:14,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 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:12:14,780 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:12:14,780 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:12:14,788 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:12:14,984 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:12:14,984 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-07 19:12:14,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:12:14,985 INFO L85 PathProgramCache]: Analyzing trace with hash -191337167, now seen corresponding path program 1 times [2024-11-07 19:12:14,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:12:14,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377261207] [2024-11-07 19:12:14,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:12:14,986 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:12:14,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:12:14,988 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:12:14,990 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:12:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:12:15,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 19:12:15,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:12:15,129 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:12:15,129 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:12:15,129 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:12:15,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377261207] [2024-11-07 19:12:15,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377261207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:12:15,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:12:15,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:12:15,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720639420] [2024-11-07 19:12:15,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:12:15,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 19:12:15,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:12:15,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 19:12:15,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:12:15,150 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54 [2024-11-07 19:12:15,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 242 flow. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 0 states have call successors, (0), 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:12:15,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:12:15,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54 [2024-11-07 19:12:15,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:12:15,806 INFO L124 PetriNetUnfolderBase]: 2489/3675 cut-off events. [2024-11-07 19:12:15,806 INFO L125 PetriNetUnfolderBase]: For 4477/4477 co-relation queries the response was YES. [2024-11-07 19:12:15,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10228 conditions, 3675 events. 2489/3675 cut-off events. For 4477/4477 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 18889 event pairs, 173 based on Foata normal form. 88/3603 useless extension candidates. Maximal degree in co-relation 10213. Up to 1088 conditions per place. [2024-11-07 19:12:15,829 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 70 selfloop transitions, 18 changer transitions 1/105 dead transitions. [2024-11-07 19:12:15,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 105 transitions, 532 flow [2024-11-07 19:12:15,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 19:12:15,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-07 19:12:15,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 231 transitions. [2024-11-07 19:12:15,834 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2024-11-07 19:12:15,834 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 242 flow. Second operand 7 states and 231 transitions. [2024-11-07 19:12:15,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 105 transitions, 532 flow [2024-11-07 19:12:15,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 105 transitions, 486 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-07 19:12:15,853 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 252 flow [2024-11-07 19:12:15,853 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=252, PETRI_PLACES=69, PETRI_TRANSITIONS=57} [2024-11-07 19:12:15,856 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 8 predicate places. [2024-11-07 19:12:15,856 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 252 flow [2024-11-07 19:12:15,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 0 states have call successors, (0), 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:12:15,857 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:12:15,857 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:12:15,862 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 (6)] Ended with exit code 0 [2024-11-07 19:12:16,057 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:12:16,058 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-07 19:12:16,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:12:16,058 INFO L85 PathProgramCache]: Analyzing trace with hash 413348032, now seen corresponding path program 1 times [2024-11-07 19:12:16,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:12:16,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049563001] [2024-11-07 19:12:16,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:12:16,059 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:12:16,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:12:16,062 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:12:16,063 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:12:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:12:16,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 19:12:16,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:12:16,266 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:12:16,266 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:12:16,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:12:16,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049563001] [2024-11-07 19:12:16,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049563001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:12:16,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:12:16,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:12:16,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266964209] [2024-11-07 19:12:16,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:12:16,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:12:16,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:12:16,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:12:16,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:12:16,269 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 54 [2024-11-07 19:12:16,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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:12:16,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:12:16,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 54 [2024-11-07 19:12:16,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:12:16,435 INFO L124 PetriNetUnfolderBase]: 1181/2147 cut-off events. [2024-11-07 19:12:16,436 INFO L125 PetriNetUnfolderBase]: For 677/721 co-relation queries the response was YES. [2024-11-07 19:12:16,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4628 conditions, 2147 events. 1181/2147 cut-off events. For 677/721 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 13200 event pairs, 1115 based on Foata normal form. 16/1915 useless extension candidates. Maximal degree in co-relation 4612. Up to 1680 conditions per place. [2024-11-07 19:12:16,444 INFO L140 encePairwiseOnDemand]: 52/54 looper letters, 22 selfloop transitions, 1 changer transitions 1/56 dead transitions. [2024-11-07 19:12:16,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 56 transitions, 298 flow [2024-11-07 19:12:16,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:12:16,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:12:16,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-11-07 19:12:16,445 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5987654320987654 [2024-11-07 19:12:16,445 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 252 flow. Second operand 3 states and 97 transitions. [2024-11-07 19:12:16,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 56 transitions, 298 flow [2024-11-07 19:12:16,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 56 transitions, 202 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-11-07 19:12:16,450 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 154 flow [2024-11-07 19:12:16,451 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2024-11-07 19:12:16,453 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -1 predicate places. [2024-11-07 19:12:16,453 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 154 flow [2024-11-07 19:12:16,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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:12:16,453 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:12:16,453 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:12:16,458 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:12:16,654 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:12:16,654 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-07 19:12:16,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:12:16,654 INFO L85 PathProgramCache]: Analyzing trace with hash 413349224, now seen corresponding path program 1 times [2024-11-07 19:12:16,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:12:16,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1533477634] [2024-11-07 19:12:16,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:12:16,655 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:12:16,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:12:16,661 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:12:16,662 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:12:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:12:16,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 19:12:16,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:12:16,955 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:12:16,956 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:12:16,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:12:16,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1533477634] [2024-11-07 19:12:16,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1533477634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:12:16,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:12:16,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:12:16,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966249290] [2024-11-07 19:12:16,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:12:16,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:12:16,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:12:16,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:12:16,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:12:16,965 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 54 [2024-11-07 19:12:16,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 154 flow. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 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:12:16,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:12:16,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 54 [2024-11-07 19:12:16,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:12:17,295 INFO L124 PetriNetUnfolderBase]: 2875/4717 cut-off events. [2024-11-07 19:12:17,296 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:12:17,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9419 conditions, 4717 events. 2875/4717 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 29156 event pairs, 738 based on Foata normal form. 16/4500 useless extension candidates. Maximal degree in co-relation 9412. Up to 2027 conditions per place. [2024-11-07 19:12:17,312 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 38 selfloop transitions, 1 changer transitions 23/92 dead transitions. [2024-11-07 19:12:17,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 92 transitions, 358 flow [2024-11-07 19:12:17,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:12:17,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:12:17,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 201 transitions. [2024-11-07 19:12:17,313 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6203703703703703 [2024-11-07 19:12:17,313 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 154 flow. Second operand 6 states and 201 transitions. [2024-11-07 19:12:17,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 92 transitions, 358 flow [2024-11-07 19:12:17,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 92 transitions, 357 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:12:17,315 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 164 flow [2024-11-07 19:12:17,315 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=164, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2024-11-07 19:12:17,315 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 6 predicate places. [2024-11-07 19:12:17,315 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 164 flow [2024-11-07 19:12:17,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 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:12:17,316 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:12:17,316 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:12:17,319 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:12:17,518 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:12:17,519 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-07 19:12:17,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:12:17,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1730998546, now seen corresponding path program 2 times [2024-11-07 19:12:17,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:12:17,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2112182423] [2024-11-07 19:12:17,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 19:12:17,520 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:12:17,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:12:17,522 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:12:17,523 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:12:17,596 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 19:12:17,596 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:12:17,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 19:12:17,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:12:17,721 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:12:17,721 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:12:17,721 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:12:17,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2112182423] [2024-11-07 19:12:17,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2112182423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:12:17,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:12:17,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:12:17,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763097411] [2024-11-07 19:12:17,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:12:17,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:12:17,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:12:17,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:12:17,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:12:17,732 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 54 [2024-11-07 19:12:17,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 164 flow. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 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:12:17,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:12:17,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 54 [2024-11-07 19:12:17,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:12:18,091 INFO L124 PetriNetUnfolderBase]: 3121/5282 cut-off events. [2024-11-07 19:12:18,091 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-11-07 19:12:18,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10515 conditions, 5282 events. 3121/5282 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 35605 event pairs, 944 based on Foata normal form. 16/4963 useless extension candidates. Maximal degree in co-relation 10504. Up to 1873 conditions per place. [2024-11-07 19:12:18,108 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 31 selfloop transitions, 1 changer transitions 24/86 dead transitions. [2024-11-07 19:12:18,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 86 transitions, 342 flow [2024-11-07 19:12:18,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:12:18,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:12:18,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2024-11-07 19:12:18,110 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6018518518518519 [2024-11-07 19:12:18,110 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 164 flow. Second operand 6 states and 195 transitions. [2024-11-07 19:12:18,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 86 transitions, 342 flow [2024-11-07 19:12:18,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 86 transitions, 331 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-07 19:12:18,112 INFO L231 Difference]: Finished difference. Result has 69 places, 55 transitions, 168 flow [2024-11-07 19:12:18,112 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=168, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2024-11-07 19:12:18,113 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 8 predicate places. [2024-11-07 19:12:18,113 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 55 transitions, 168 flow [2024-11-07 19:12:18,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 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:12:18,113 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:12:18,113 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:12:18,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-07 19:12:18,313 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:12:18,314 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-07 19:12:18,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:12:18,314 INFO L85 PathProgramCache]: Analyzing trace with hash 683706640, now seen corresponding path program 3 times [2024-11-07 19:12:18,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:12:18,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056070555] [2024-11-07 19:12:18,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 19:12:18,315 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:12:18,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:12:18,317 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:12:18,322 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:12:18,389 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-07 19:12:18,389 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:12:18,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-07 19:12:18,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:12:19,198 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:12:19,199 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:12:19,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:12:19,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056070555] [2024-11-07 19:12:19,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056070555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:12:19,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:12:19,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 19:12:19,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761531183] [2024-11-07 19:12:19,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:12:19,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 19:12:19,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:12:19,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 19:12:19,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-07 19:12:19,211 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 54 [2024-11-07 19:12:19,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 55 transitions, 168 flow. Second operand has 12 states, 12 states have (on average 25.666666666666668) internal successors, (308), 12 states have internal predecessors, (308), 0 states have call successors, (0), 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:12:19,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:12:19,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 54 [2024-11-07 19:12:19,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:12:19,763 INFO L124 PetriNetUnfolderBase]: 2790/4871 cut-off events. [2024-11-07 19:12:19,764 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-11-07 19:12:19,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9758 conditions, 4871 events. 2790/4871 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 32194 event pairs, 958 based on Foata normal form. 16/4540 useless extension candidates. Maximal degree in co-relation 9746. Up to 1599 conditions per place. [2024-11-07 19:12:19,780 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 44 selfloop transitions, 7 changer transitions 22/104 dead transitions. [2024-11-07 19:12:19,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 104 transitions, 430 flow [2024-11-07 19:12:19,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 19:12:19,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 19:12:19,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 266 transitions. [2024-11-07 19:12:19,783 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6157407407407407 [2024-11-07 19:12:19,783 INFO L175 Difference]: Start difference. First operand has 69 places, 55 transitions, 168 flow. Second operand 8 states and 266 transitions. [2024-11-07 19:12:19,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 104 transitions, 430 flow [2024-11-07 19:12:19,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 104 transitions, 419 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-07 19:12:19,786 INFO L231 Difference]: Finished difference. Result has 72 places, 58 transitions, 189 flow [2024-11-07 19:12:19,787 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=189, PETRI_PLACES=72, PETRI_TRANSITIONS=58} [2024-11-07 19:12:19,787 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 11 predicate places. [2024-11-07 19:12:19,787 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 58 transitions, 189 flow [2024-11-07 19:12:19,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 25.666666666666668) internal successors, (308), 12 states have internal predecessors, (308), 0 states have call successors, (0), 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:12:19,788 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:12:19,788 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:12:19,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-07 19:12:19,991 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:12:19,992 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-07 19:12:19,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:12:19,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1231916822, now seen corresponding path program 4 times [2024-11-07 19:12:19,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:12:19,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444448922] [2024-11-07 19:12:19,995 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-07 19:12:19,995 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:12:19,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:12:19,997 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:12:19,999 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:12:20,062 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-07 19:12:20,062 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:12:20,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 19:12:20,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:12:20,109 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:12:20,109 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:12:20,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:12:20,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [444448922] [2024-11-07 19:12:20,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [444448922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:12:20,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:12:20,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:12:20,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107059611] [2024-11-07 19:12:20,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:12:20,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:12:20,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:12:20,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:12:20,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:12:20,118 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 54 [2024-11-07 19:12:20,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 58 transitions, 189 flow. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 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:12:20,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:12:20,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 54 [2024-11-07 19:12:20,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:12:20,682 INFO L124 PetriNetUnfolderBase]: 5527/9339 cut-off events. [2024-11-07 19:12:20,682 INFO L125 PetriNetUnfolderBase]: For 455/455 co-relation queries the response was YES. [2024-11-07 19:12:20,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19764 conditions, 9339 events. 5527/9339 cut-off events. For 455/455 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 67770 event pairs, 1859 based on Foata normal form. 16/8706 useless extension candidates. Maximal degree in co-relation 19751. Up to 3710 conditions per place. [2024-11-07 19:12:20,701 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 28 selfloop transitions, 1 changer transitions 36/95 dead transitions. [2024-11-07 19:12:20,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 95 transitions, 412 flow [2024-11-07 19:12:20,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:12:20,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:12:20,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2024-11-07 19:12:20,702 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2024-11-07 19:12:20,702 INFO L175 Difference]: Start difference. First operand has 72 places, 58 transitions, 189 flow. Second operand 6 states and 198 transitions. [2024-11-07 19:12:20,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 95 transitions, 412 flow [2024-11-07 19:12:20,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 95 transitions, 405 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-07 19:12:20,704 INFO L231 Difference]: Finished difference. Result has 76 places, 56 transitions, 185 flow [2024-11-07 19:12:20,705 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=185, PETRI_PLACES=76, PETRI_TRANSITIONS=56} [2024-11-07 19:12:20,705 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 15 predicate places. [2024-11-07 19:12:20,705 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 56 transitions, 185 flow [2024-11-07 19:12:20,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 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:12:20,707 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:12:20,707 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:12:20,711 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:12:20,908 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:12:20,908 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-07 19:12:20,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:12:20,909 INFO L85 PathProgramCache]: Analyzing trace with hash -211689600, now seen corresponding path program 5 times [2024-11-07 19:12:20,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:12:20,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1597346086] [2024-11-07 19:12:20,909 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-07 19:12:20,909 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:12:20,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:12:20,911 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:12:20,913 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:12:20,982 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 19:12:20,982 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-07 19:12:20,982 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:12:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:12:21,090 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-07 19:12:21,091 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:12:21,091 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-07 19:12:21,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-07 19:12:21,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-07 19:12:21,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-07 19:12:21,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-07 19:12:21,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-07 19:12:21,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-07 19:12:21,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-07 19:12:21,097 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:12:21,293 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:12:21,294 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2024-11-07 19:12:21,375 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 19:12:21,377 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 19:12:21,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:12:21 BasicIcfg [2024-11-07 19:12:21,381 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 19:12:21,382 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 19:12:21,382 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 19:12:21,382 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 19:12:21,383 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:12:09" (3/4) ... [2024-11-07 19:12:21,384 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 19:12:21,384 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 19:12:21,385 INFO L158 Benchmark]: Toolchain (without parser) took 13263.10ms. Allocated memory was 83.9MB in the beginning and 939.5MB in the end (delta: 855.6MB). Free memory was 58.7MB in the beginning and 639.6MB in the end (delta: -580.9MB). Peak memory consumption was 275.3MB. Max. memory is 16.1GB. [2024-11-07 19:12:21,385 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 83.9MB. Free memory was 64.9MB in the beginning and 64.9MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:12:21,385 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.43ms. Allocated memory is still 83.9MB. Free memory was 58.7MB in the beginning and 34.8MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 19:12:21,386 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.78ms. Allocated memory is still 83.9MB. Free memory was 34.8MB in the beginning and 32.2MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:12:21,386 INFO L158 Benchmark]: Boogie Preprocessor took 66.99ms. Allocated memory is still 83.9MB. Free memory was 32.2MB in the beginning and 28.9MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 19:12:21,386 INFO L158 Benchmark]: RCFGBuilder took 822.34ms. Allocated memory is still 83.9MB. Free memory was 28.9MB in the beginning and 25.6MB in the end (delta: 3.4MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2024-11-07 19:12:21,386 INFO L158 Benchmark]: TraceAbstraction took 11938.42ms. Allocated memory was 83.9MB in the beginning and 939.5MB in the end (delta: 855.6MB). Free memory was 25.1MB in the beginning and 639.7MB in the end (delta: -614.6MB). Peak memory consumption was 244.3MB. Max. memory is 16.1GB. [2024-11-07 19:12:21,387 INFO L158 Benchmark]: Witness Printer took 2.37ms. Allocated memory is still 939.5MB. Free memory was 639.7MB in the beginning and 639.6MB in the end (delta: 86.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:12:21,388 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.13ms. Allocated memory is still 83.9MB. Free memory was 64.9MB in the beginning and 64.9MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 380.43ms. Allocated memory is still 83.9MB. Free memory was 58.7MB in the beginning and 34.8MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.78ms. Allocated memory is still 83.9MB. Free memory was 34.8MB in the beginning and 32.2MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 66.99ms. Allocated memory is still 83.9MB. Free memory was 32.2MB in the beginning and 28.9MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 822.34ms. Allocated memory is still 83.9MB. Free memory was 28.9MB in the beginning and 25.6MB in the end (delta: 3.4MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11938.42ms. Allocated memory was 83.9MB in the beginning and 939.5MB in the end (delta: 855.6MB). Free memory was 25.1MB in the beginning and 639.7MB in the end (delta: -614.6MB). Peak memory consumption was 244.3MB. Max. memory is 16.1GB. * Witness Printer took 2.37ms. Allocated memory is still 939.5MB. Free memory was 639.7MB in the beginning and 639.6MB in the end (delta: 86.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L853] 0 pthread_t t489; [L854] FCALL, FORK 0 pthread_create(&t489, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t489=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L855] 0 pthread_t t490; [L856] FCALL, FORK 0 pthread_create(&t490, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t489=0, t490=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L857] 0 pthread_t t491; [L858] FCALL, FORK 0 pthread_create(&t491, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t489=0, t490=1, t491=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L859] 0 pthread_t t492; [L785] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L860] FCALL, FORK 0 pthread_create(&t492, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t489=0, t490=1, t491=2, t492=3, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L802] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L822] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L825] 4 __unbuffered_p3_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L828] 4 __unbuffered_p3_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L752] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L755] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L831] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L832] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L833] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L834] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L835] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L838] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t489=0, t490=1, t491=2, t492=3, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L867] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L868] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L869] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L870] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t489=0, t490=1, t491=2, t492=3, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L873] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L874] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L875] 0 x$flush_delayed = weak$$choice2 [L876] 0 x$mem_tmp = x [L877] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L878] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L879] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L880] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L881] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L883] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L884] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L885] 0 x = x$flush_delayed ? x$mem_tmp : x [L886] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t489=0, t490=1, t491=2, t492=3, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix018_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 87 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 591 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 565 mSDsluCounter, 111 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 99 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1868 IncrementalHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 12 mSDtfsCounter, 1868 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=252occurred in iteration=5, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 332 NumberOfCodeBlocks, 331 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 284 ConstructedInterpolants, 0 QuantifiedInterpolants, 1358 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1317 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 19:12:21,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample