./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.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/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.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', '2b11be791089901ed5596869d293da40c27b85c1e89c21a55cf2181db7595687'] 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/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.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 2b11be791089901ed5596869d293da40c27b85c1e89c21a55cf2181db7595687 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:19:26,449 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:19:26,562 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:19:26,568 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:19:26,569 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:19:26,594 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:19:26,595 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:19:26,595 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:19:26,596 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:19:26,596 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:19:26,597 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:19:26,597 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:19:26,597 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:19:26,598 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:19:26,598 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:19:26,598 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:19:26,598 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:19:26,598 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:19:26,598 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:19:26,599 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:19:26,599 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 19:19:26,599 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 19:19:26,599 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 19:19:26,599 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:19:26,599 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:19:26,599 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:19:26,600 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:19:26,600 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:19:26,600 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:19:26,600 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:19:26,600 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:19:26,600 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:19:26,601 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:19:26,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:19:26,601 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:19:26,601 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:19:26,602 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 19:19:26,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 19:19:26,602 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:19:26,602 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:19:26,602 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:19:26,602 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:19:26,602 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 -> 2b11be791089901ed5596869d293da40c27b85c1e89c21a55cf2181db7595687 [2024-11-07 19:19:26,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:19:26,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:19:26,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:19:26,903 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:19:26,903 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:19:26,904 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-07 19:19:28,178 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:19:28,500 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:19:28,502 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-07 19:19:28,522 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d2b1a9b34/992ea5cc607f4f77badb3c57164cb12c/FLAG6892f2cfd [2024-11-07 19:19:28,543 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d2b1a9b34/992ea5cc607f4f77badb3c57164cb12c [2024-11-07 19:19:28,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:19:28,547 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:19:28,548 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:19:28,549 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:19:28,553 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:19:28,554 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:19:28" (1/1) ... [2024-11-07 19:19:28,555 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@531b1562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:28, skipping insertion in model container [2024-11-07 19:19:28,555 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:19:28" (1/1) ... [2024-11-07 19:19:28,602 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:19:28,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:19:28,979 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:19:29,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:19:29,130 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:19:29,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:29 WrapperNode [2024-11-07 19:19:29,131 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:19:29,132 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:19:29,132 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:19:29,132 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:19:29,138 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:19:29" (1/1) ... [2024-11-07 19:19:29,160 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:19:29" (1/1) ... [2024-11-07 19:19:29,195 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2024-11-07 19:19:29,198 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:19:29,199 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:19:29,199 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:19:29,199 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:19:29,208 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:29" (1/1) ... [2024-11-07 19:19:29,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:29" (1/1) ... [2024-11-07 19:19:29,214 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:29" (1/1) ... [2024-11-07 19:19:29,245 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:19:29,245 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:29" (1/1) ... [2024-11-07 19:19:29,245 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:29" (1/1) ... [2024-11-07 19:19:29,260 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:29" (1/1) ... [2024-11-07 19:19:29,266 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:29" (1/1) ... [2024-11-07 19:19:29,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:29" (1/1) ... [2024-11-07 19:19:29,270 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:29" (1/1) ... [2024-11-07 19:19:29,276 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:19:29,277 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:19:29,277 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:19:29,277 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:19:29,278 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:29" (1/1) ... [2024-11-07 19:19:29,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:19:29,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:19:29,314 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:19:29,316 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:19:29,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-07 19:19:29,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:19:29,332 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-07 19:19:29,332 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-07 19:19:29,332 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-07 19:19:29,332 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-07 19:19:29,332 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-07 19:19:29,332 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-07 19:19:29,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 19:19:29,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-07 19:19:29,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:19:29,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:19:29,333 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:19:29,440 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:19:29,441 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:19:29,871 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 19:19:29,871 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:19:30,165 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:19:30,167 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 19:19:30,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:19:30 BoogieIcfgContainer [2024-11-07 19:19:30,167 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:19:30,170 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:19:30,171 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:19:30,176 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:19:30,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:19:28" (1/3) ... [2024-11-07 19:19:30,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35d1a799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:19:30, skipping insertion in model container [2024-11-07 19:19:30,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:29" (2/3) ... [2024-11-07 19:19:30,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35d1a799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:19:30, skipping insertion in model container [2024-11-07 19:19:30,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:19:30" (3/3) ... [2024-11-07 19:19:30,180 INFO L112 eAbstractionObserver]: Analyzing ICFG safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-07 19:19:30,194 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:19:30,195 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-07 19:19:30,196 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 19:19:30,268 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 19:19:30,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 102 flow [2024-11-07 19:19:30,341 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2024-11-07 19:19:30,343 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:19:30,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 42 events. 2/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-11-07 19:19:30,348 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 45 transitions, 102 flow [2024-11-07 19:19:30,352 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 42 transitions, 93 flow [2024-11-07 19:19:30,364 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:19:30,379 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;@2265d29c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:19:30,381 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-07 19:19:30,387 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:19:30,387 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-07 19:19:30,388 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:19:30,388 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:19:30,388 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 19:19:30,389 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:19:30,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:19:30,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1074764894, now seen corresponding path program 1 times [2024-11-07 19:19:30,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:19:30,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902700655] [2024-11-07 19:19:30,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:19:30,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:19:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:19:30,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:19:30,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:19:30,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902700655] [2024-11-07 19:19:30,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902700655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:19:30,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:19:30,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:19:30,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881478163] [2024-11-07 19:19:30,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:19:30,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:19:30,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:19:30,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:19:30,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:19:30,953 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-07 19:19:30,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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:19:30,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:19:30,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-07 19:19:30,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:19:31,760 INFO L124 PetriNetUnfolderBase]: 1647/2787 cut-off events. [2024-11-07 19:19:31,761 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-11-07 19:19:31,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5262 conditions, 2787 events. 1647/2787 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 17190 event pairs, 546 based on Foata normal form. 160/2931 useless extension candidates. Maximal degree in co-relation 5251. Up to 1942 conditions per place. [2024-11-07 19:19:31,789 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 37 selfloop transitions, 2 changer transitions 2/55 dead transitions. [2024-11-07 19:19:31,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 55 transitions, 204 flow [2024-11-07 19:19:31,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:19:31,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:19:31,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-11-07 19:19:31,800 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7185185185185186 [2024-11-07 19:19:31,802 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 93 flow. Second operand 3 states and 97 transitions. [2024-11-07 19:19:31,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 55 transitions, 204 flow [2024-11-07 19:19:31,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 200 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 19:19:31,808 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 84 flow [2024-11-07 19:19:31,810 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-11-07 19:19:31,814 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2024-11-07 19:19:31,814 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 84 flow [2024-11-07 19:19:31,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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:19:31,815 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:19:31,815 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:19:31,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 19:19:31,816 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:19:31,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:19:31,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1977289181, now seen corresponding path program 1 times [2024-11-07 19:19:31,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:19:31,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591860118] [2024-11-07 19:19:31,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:19:31,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:19:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:19:31,964 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:19:31,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:19:31,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591860118] [2024-11-07 19:19:31,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591860118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:19:31,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:19:31,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:19:31,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021335564] [2024-11-07 19:19:31,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:19:31,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:19:31,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:19:31,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:19:31,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:19:31,969 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-07 19:19:31,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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:19:31,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:19:31,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-07 19:19:31,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:19:32,447 INFO L124 PetriNetUnfolderBase]: 1463/2556 cut-off events. [2024-11-07 19:19:32,448 INFO L125 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2024-11-07 19:19:32,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4936 conditions, 2556 events. 1463/2556 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 16561 event pairs, 1463 based on Foata normal form. 80/2578 useless extension candidates. Maximal degree in co-relation 4926. Up to 2154 conditions per place. [2024-11-07 19:19:32,465 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 21 selfloop transitions, 1 changer transitions 1/36 dead transitions. [2024-11-07 19:19:32,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 128 flow [2024-11-07 19:19:32,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:19:32,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:19:32,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2024-11-07 19:19:32,467 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-11-07 19:19:32,467 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 84 flow. Second operand 3 states and 72 transitions. [2024-11-07 19:19:32,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 128 flow [2024-11-07 19:19:32,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:19:32,470 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2024-11-07 19:19:32,471 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2024-11-07 19:19:32,473 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2024-11-07 19:19:32,473 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow [2024-11-07 19:19:32,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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:19:32,473 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:19:32,473 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:19:32,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 19:19:32,473 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:19:32,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:19:32,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1977289227, now seen corresponding path program 1 times [2024-11-07 19:19:32,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:19:32,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521271385] [2024-11-07 19:19:32,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:19:32,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:19:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:19:32,759 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:19:32,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:19:32,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521271385] [2024-11-07 19:19:32,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521271385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:19:32,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:19:32,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:19:32,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625996284] [2024-11-07 19:19:32,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:19:32,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:19:32,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:19:32,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:19:32,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:19:32,774 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-11-07 19:19:32,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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:19:32,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:19:32,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-11-07 19:19:32,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:19:33,437 INFO L124 PetriNetUnfolderBase]: 2482/4049 cut-off events. [2024-11-07 19:19:33,437 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:19:33,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7816 conditions, 4049 events. 2482/4049 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 24609 event pairs, 330 based on Foata normal form. 150/4168 useless extension candidates. Maximal degree in co-relation 7810. Up to 2227 conditions per place. [2024-11-07 19:19:33,461 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 49 selfloop transitions, 5 changer transitions 1/64 dead transitions. [2024-11-07 19:19:33,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 64 transitions, 250 flow [2024-11-07 19:19:33,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:19:33,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:19:33,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-11-07 19:19:33,464 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6055555555555555 [2024-11-07 19:19:33,464 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 4 states and 109 transitions. [2024-11-07 19:19:33,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 64 transitions, 250 flow [2024-11-07 19:19:33,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 64 transitions, 249 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:19:33,467 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 111 flow [2024-11-07 19:19:33,467 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2024-11-07 19:19:33,468 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2024-11-07 19:19:33,468 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 111 flow [2024-11-07 19:19:33,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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:19:33,469 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:19:33,469 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:19:33,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 19:19:33,469 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:19:33,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:19:33,470 INFO L85 PathProgramCache]: Analyzing trace with hash -847484819, now seen corresponding path program 1 times [2024-11-07 19:19:33,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:19:33,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233244799] [2024-11-07 19:19:33,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:19:33,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:19:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:19:33,819 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:19:33,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:19:33,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233244799] [2024-11-07 19:19:33,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233244799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:19:33,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:19:33,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:19:33,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604699529] [2024-11-07 19:19:33,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:19:33,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:19:33,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:19:33,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:19:33,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:19:33,825 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-11-07 19:19:33,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:19:33,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:19:33,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-11-07 19:19:33,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:19:34,323 INFO L124 PetriNetUnfolderBase]: 1450/2387 cut-off events. [2024-11-07 19:19:34,323 INFO L125 PetriNetUnfolderBase]: For 493/493 co-relation queries the response was YES. [2024-11-07 19:19:34,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5417 conditions, 2387 events. 1450/2387 cut-off events. For 493/493 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 12664 event pairs, 200 based on Foata normal form. 114/2476 useless extension candidates. Maximal degree in co-relation 5408. Up to 841 conditions per place. [2024-11-07 19:19:34,339 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 62 selfloop transitions, 8 changer transitions 1/80 dead transitions. [2024-11-07 19:19:34,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 80 transitions, 358 flow [2024-11-07 19:19:34,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:19:34,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:19:34,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2024-11-07 19:19:34,343 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6133333333333333 [2024-11-07 19:19:34,343 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 111 flow. Second operand 5 states and 138 transitions. [2024-11-07 19:19:34,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 80 transitions, 358 flow [2024-11-07 19:19:34,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 80 transitions, 348 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-07 19:19:34,348 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 151 flow [2024-11-07 19:19:34,348 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2024-11-07 19:19:34,349 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2024-11-07 19:19:34,349 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 151 flow [2024-11-07 19:19:34,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:19:34,350 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:19:34,350 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:19:34,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 19:19:34,350 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:19:34,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:19:34,351 INFO L85 PathProgramCache]: Analyzing trace with hash 555899990, now seen corresponding path program 1 times [2024-11-07 19:19:34,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:19:34,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753560932] [2024-11-07 19:19:34,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:19:34,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:19:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:19:34,732 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:19:34,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:19:34,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753560932] [2024-11-07 19:19:34,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753560932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:19:34,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:19:34,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:19:34,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503217446] [2024-11-07 19:19:34,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:19:34,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:19:34,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:19:34,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:19:34,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:19:34,739 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-11-07 19:19:34,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 151 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 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:19:34,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:19:34,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-11-07 19:19:34,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:19:35,086 INFO L124 PetriNetUnfolderBase]: 845/1356 cut-off events. [2024-11-07 19:19:35,087 INFO L125 PetriNetUnfolderBase]: For 914/914 co-relation queries the response was YES. [2024-11-07 19:19:35,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3455 conditions, 1356 events. 845/1356 cut-off events. For 914/914 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6213 event pairs, 175 based on Foata normal form. 48/1379 useless extension candidates. Maximal degree in co-relation 3444. Up to 466 conditions per place. [2024-11-07 19:19:35,095 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 53 selfloop transitions, 11 changer transitions 1/74 dead transitions. [2024-11-07 19:19:35,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 74 transitions, 357 flow [2024-11-07 19:19:35,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:19:35,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:19:35,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2024-11-07 19:19:35,097 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2024-11-07 19:19:35,097 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 151 flow. Second operand 6 states and 145 transitions. [2024-11-07 19:19:35,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 74 transitions, 357 flow [2024-11-07 19:19:35,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 74 transitions, 332 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-07 19:19:35,105 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 165 flow [2024-11-07 19:19:35,105 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2024-11-07 19:19:35,105 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2024-11-07 19:19:35,105 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 165 flow [2024-11-07 19:19:35,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 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:19:35,105 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:19:35,106 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] [2024-11-07 19:19:35,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 19:19:35,106 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:19:35,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:19:35,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1131466313, now seen corresponding path program 1 times [2024-11-07 19:19:35,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:19:35,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828957234] [2024-11-07 19:19:35,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:19:35,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:19:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:19:36,284 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:19:36,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:19:36,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828957234] [2024-11-07 19:19:36,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828957234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:19:36,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:19:36,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 19:19:36,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964432244] [2024-11-07 19:19:36,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:19:36,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 19:19:36,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:19:36,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 19:19:36,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 19:19:36,299 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-07 19:19:36,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 165 flow. Second operand has 8 states, 8 states have (on average 18.5) internal successors, (148), 8 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:19:36,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:19:36,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-07 19:19:36,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:19:36,952 INFO L124 PetriNetUnfolderBase]: 1239/2259 cut-off events. [2024-11-07 19:19:36,952 INFO L125 PetriNetUnfolderBase]: For 1207/1229 co-relation queries the response was YES. [2024-11-07 19:19:36,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5413 conditions, 2259 events. 1239/2259 cut-off events. For 1207/1229 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 13690 event pairs, 292 based on Foata normal form. 8/2193 useless extension candidates. Maximal degree in co-relation 5401. Up to 799 conditions per place. [2024-11-07 19:19:36,968 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 37 selfloop transitions, 11 changer transitions 30/96 dead transitions. [2024-11-07 19:19:36,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 96 transitions, 459 flow [2024-11-07 19:19:36,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 19:19:36,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 19:19:36,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 223 transitions. [2024-11-07 19:19:36,970 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5506172839506173 [2024-11-07 19:19:36,970 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 165 flow. Second operand 9 states and 223 transitions. [2024-11-07 19:19:36,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 96 transitions, 459 flow [2024-11-07 19:19:36,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 96 transitions, 379 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-11-07 19:19:36,987 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 184 flow [2024-11-07 19:19:36,987 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=184, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2024-11-07 19:19:36,987 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2024-11-07 19:19:36,987 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 184 flow [2024-11-07 19:19:36,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.5) internal successors, (148), 8 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:19:36,988 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:19:36,988 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] [2024-11-07 19:19:36,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 19:19:36,988 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:19:36,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:19:36,988 INFO L85 PathProgramCache]: Analyzing trace with hash -652817733, now seen corresponding path program 2 times [2024-11-07 19:19:36,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:19:36,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616508692] [2024-11-07 19:19:36,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:19:36,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:19:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:19:37,467 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:19:37,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:19:37,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616508692] [2024-11-07 19:19:37,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616508692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:19:37,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:19:37,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:19:37,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537543806] [2024-11-07 19:19:37,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:19:37,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:19:37,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:19:37,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:19:37,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:19:37,478 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-11-07 19:19:37,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 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:19:37,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:19:37,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-11-07 19:19:37,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:19:38,055 INFO L124 PetriNetUnfolderBase]: 1759/3104 cut-off events. [2024-11-07 19:19:38,056 INFO L125 PetriNetUnfolderBase]: For 900/922 co-relation queries the response was YES. [2024-11-07 19:19:38,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7628 conditions, 3104 events. 1759/3104 cut-off events. For 900/922 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 19514 event pairs, 412 based on Foata normal form. 28/3018 useless extension candidates. Maximal degree in co-relation 7614. Up to 1206 conditions per place. [2024-11-07 19:19:38,078 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 53 selfloop transitions, 3 changer transitions 18/92 dead transitions. [2024-11-07 19:19:38,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 92 transitions, 478 flow [2024-11-07 19:19:38,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:19:38,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:19:38,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2024-11-07 19:19:38,081 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5407407407407407 [2024-11-07 19:19:38,081 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 184 flow. Second operand 6 states and 146 transitions. [2024-11-07 19:19:38,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 92 transitions, 478 flow [2024-11-07 19:19:38,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 461 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-11-07 19:19:38,086 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 187 flow [2024-11-07 19:19:38,086 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2024-11-07 19:19:38,088 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2024-11-07 19:19:38,089 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 187 flow [2024-11-07 19:19:38,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 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:19:38,089 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:19:38,089 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] [2024-11-07 19:19:38,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 19:19:38,089 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:19:38,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:19:38,090 INFO L85 PathProgramCache]: Analyzing trace with hash -561195613, now seen corresponding path program 3 times [2024-11-07 19:19:38,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:19:38,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077065155] [2024-11-07 19:19:38,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:19:38,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:19:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:19:40,436 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:19:40,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:19:40,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077065155] [2024-11-07 19:19:40,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077065155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:19:40,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:19:40,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 19:19:40,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545076226] [2024-11-07 19:19:40,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:19:40,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 19:19:40,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:19:40,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 19:19:40,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-07 19:19:40,457 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-07 19:19:40,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 187 flow. Second operand has 11 states, 11 states have (on average 17.818181818181817) internal successors, (196), 11 states have internal predecessors, (196), 0 states have call successors, (0), 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:19:40,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:19:40,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-07 19:19:40,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:19:41,130 INFO L124 PetriNetUnfolderBase]: 1030/1916 cut-off events. [2024-11-07 19:19:41,131 INFO L125 PetriNetUnfolderBase]: For 525/543 co-relation queries the response was YES. [2024-11-07 19:19:41,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4705 conditions, 1916 events. 1030/1916 cut-off events. For 525/543 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 10947 event pairs, 278 based on Foata normal form. 12/1883 useless extension candidates. Maximal degree in co-relation 4691. Up to 806 conditions per place. [2024-11-07 19:19:41,148 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 40 selfloop transitions, 8 changer transitions 37/103 dead transitions. [2024-11-07 19:19:41,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 103 transitions, 538 flow [2024-11-07 19:19:41,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 19:19:41,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 19:19:41,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 217 transitions. [2024-11-07 19:19:41,151 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5358024691358024 [2024-11-07 19:19:41,151 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 187 flow. Second operand 9 states and 217 transitions. [2024-11-07 19:19:41,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 103 transitions, 538 flow [2024-11-07 19:19:41,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 103 transitions, 522 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-07 19:19:41,154 INFO L231 Difference]: Finished difference. Result has 67 places, 53 transitions, 234 flow [2024-11-07 19:19:41,154 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=234, PETRI_PLACES=67, PETRI_TRANSITIONS=53} [2024-11-07 19:19:41,155 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 17 predicate places. [2024-11-07 19:19:41,155 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 53 transitions, 234 flow [2024-11-07 19:19:41,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.818181818181817) internal successors, (196), 11 states have internal predecessors, (196), 0 states have call successors, (0), 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:19:41,156 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:19:41,158 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] [2024-11-07 19:19:41,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 19:19:41,158 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:19:41,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:19:41,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1108332617, now seen corresponding path program 4 times [2024-11-07 19:19:41,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:19:41,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156494357] [2024-11-07 19:19:41,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:19:41,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:19:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:19:43,433 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:19:43,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:19:43,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156494357] [2024-11-07 19:19:43,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156494357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:19:43,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:19:43,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 19:19:43,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384313811] [2024-11-07 19:19:43,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:19:43,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 19:19:43,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:19:43,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 19:19:43,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 19:19:43,455 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-11-07 19:19:43,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 53 transitions, 234 flow. Second operand has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:19:43,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:19:43,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-11-07 19:19:43,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:19:44,213 INFO L124 PetriNetUnfolderBase]: 1035/1929 cut-off events. [2024-11-07 19:19:44,214 INFO L125 PetriNetUnfolderBase]: For 1085/1085 co-relation queries the response was YES. [2024-11-07 19:19:44,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5018 conditions, 1929 events. 1035/1929 cut-off events. For 1085/1085 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 11197 event pairs, 213 based on Foata normal form. 8/1906 useless extension candidates. Maximal degree in co-relation 5001. Up to 794 conditions per place. [2024-11-07 19:19:44,224 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 43 selfloop transitions, 14 changer transitions 34/108 dead transitions. [2024-11-07 19:19:44,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 108 transitions, 607 flow [2024-11-07 19:19:44,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 19:19:44,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 19:19:44,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 218 transitions. [2024-11-07 19:19:44,227 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5382716049382716 [2024-11-07 19:19:44,227 INFO L175 Difference]: Start difference. First operand has 67 places, 53 transitions, 234 flow. Second operand 9 states and 218 transitions. [2024-11-07 19:19:44,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 108 transitions, 607 flow [2024-11-07 19:19:44,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 108 transitions, 585 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-11-07 19:19:44,234 INFO L231 Difference]: Finished difference. Result has 74 places, 58 transitions, 319 flow [2024-11-07 19:19:44,234 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=319, PETRI_PLACES=74, PETRI_TRANSITIONS=58} [2024-11-07 19:19:44,234 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 24 predicate places. [2024-11-07 19:19:44,234 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 58 transitions, 319 flow [2024-11-07 19:19:44,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:19:44,235 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:19:44,235 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] [2024-11-07 19:19:44,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 19:19:44,235 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:19:44,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:19:44,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1708376753, now seen corresponding path program 5 times [2024-11-07 19:19:44,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:19:44,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782175749] [2024-11-07 19:19:44,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:19:44,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:19:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:19:45,966 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:19:45,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:19:45,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782175749] [2024-11-07 19:19:45,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782175749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:19:45,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:19:45,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 19:19:45,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703696136] [2024-11-07 19:19:45,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:19:45,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 19:19:45,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:19:45,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 19:19:45,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-07 19:19:45,986 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-07 19:19:45,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 58 transitions, 319 flow. Second operand has 11 states, 11 states have (on average 17.818181818181817) internal successors, (196), 11 states have internal predecessors, (196), 0 states have call successors, (0), 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:19:45,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:19:45,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-07 19:19:45,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:19:46,739 INFO L124 PetriNetUnfolderBase]: 995/1877 cut-off events. [2024-11-07 19:19:46,739 INFO L125 PetriNetUnfolderBase]: For 1705/1741 co-relation queries the response was YES. [2024-11-07 19:19:46,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4997 conditions, 1877 events. 995/1877 cut-off events. For 1705/1741 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 11117 event pairs, 234 based on Foata normal form. 20/1819 useless extension candidates. Maximal degree in co-relation 4975. Up to 594 conditions per place. [2024-11-07 19:19:46,752 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 47 selfloop transitions, 12 changer transitions 25/103 dead transitions. [2024-11-07 19:19:46,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 103 transitions, 623 flow [2024-11-07 19:19:46,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 19:19:46,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 19:19:46,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 217 transitions. [2024-11-07 19:19:46,754 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5358024691358024 [2024-11-07 19:19:46,754 INFO L175 Difference]: Start difference. First operand has 74 places, 58 transitions, 319 flow. Second operand 9 states and 217 transitions. [2024-11-07 19:19:46,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 103 transitions, 623 flow [2024-11-07 19:19:46,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 103 transitions, 601 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-11-07 19:19:46,763 INFO L231 Difference]: Finished difference. Result has 79 places, 60 transitions, 355 flow [2024-11-07 19:19:46,763 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=355, PETRI_PLACES=79, PETRI_TRANSITIONS=60} [2024-11-07 19:19:46,763 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 29 predicate places. [2024-11-07 19:19:46,763 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 60 transitions, 355 flow [2024-11-07 19:19:46,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.818181818181817) internal successors, (196), 11 states have internal predecessors, (196), 0 states have call successors, (0), 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:19:46,764 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:19:46,764 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] [2024-11-07 19:19:46,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 19:19:46,764 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:19:46,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:19:46,764 INFO L85 PathProgramCache]: Analyzing trace with hash 831152951, now seen corresponding path program 6 times [2024-11-07 19:19:46,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:19:46,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470526709] [2024-11-07 19:19:46,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:19:46,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:19:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:19:48,366 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:19:48,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:19:48,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470526709] [2024-11-07 19:19:48,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470526709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:19:48,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:19:48,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 19:19:48,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591595101] [2024-11-07 19:19:48,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:19:48,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 19:19:48,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:19:48,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 19:19:48,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-07 19:19:48,384 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-07 19:19:48,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 60 transitions, 355 flow. Second operand has 12 states, 12 states have (on average 17.666666666666668) internal successors, (212), 12 states have internal predecessors, (212), 0 states have call successors, (0), 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:19:48,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:19:48,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-07 19:19:48,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:19:49,079 INFO L124 PetriNetUnfolderBase]: 1070/2018 cut-off events. [2024-11-07 19:19:49,079 INFO L125 PetriNetUnfolderBase]: For 2658/2740 co-relation queries the response was YES. [2024-11-07 19:19:49,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5820 conditions, 2018 events. 1070/2018 cut-off events. For 2658/2740 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 11888 event pairs, 316 based on Foata normal form. 38/1987 useless extension candidates. Maximal degree in co-relation 5795. Up to 1009 conditions per place. [2024-11-07 19:19:49,093 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 48 selfloop transitions, 10 changer transitions 34/111 dead transitions. [2024-11-07 19:19:49,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 111 transitions, 737 flow [2024-11-07 19:19:49,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 19:19:49,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-07 19:19:49,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 238 transitions. [2024-11-07 19:19:49,096 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5288888888888889 [2024-11-07 19:19:49,096 INFO L175 Difference]: Start difference. First operand has 79 places, 60 transitions, 355 flow. Second operand 10 states and 238 transitions. [2024-11-07 19:19:49,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 111 transitions, 737 flow [2024-11-07 19:19:49,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 111 transitions, 692 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-11-07 19:19:49,107 INFO L231 Difference]: Finished difference. Result has 82 places, 62 transitions, 382 flow [2024-11-07 19:19:49,107 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=382, PETRI_PLACES=82, PETRI_TRANSITIONS=62} [2024-11-07 19:19:49,108 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 32 predicate places. [2024-11-07 19:19:49,108 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 62 transitions, 382 flow [2024-11-07 19:19:49,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 17.666666666666668) internal successors, (212), 12 states have internal predecessors, (212), 0 states have call successors, (0), 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:19:49,108 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:19:49,108 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] [2024-11-07 19:19:49,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 19:19:49,109 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:19:49,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:19:49,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1894614821, now seen corresponding path program 7 times [2024-11-07 19:19:49,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:19:49,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570694450] [2024-11-07 19:19:49,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:19:49,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:19:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:19:51,879 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:19:51,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:19:51,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570694450] [2024-11-07 19:19:51,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570694450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:19:51,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:19:51,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 19:19:51,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441715611] [2024-11-07 19:19:51,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:19:51,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 19:19:51,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:19:51,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 19:19:51,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-07 19:19:51,910 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-11-07 19:19:51,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 62 transitions, 382 flow. Second operand has 13 states, 13 states have (on average 16.615384615384617) internal successors, (216), 13 states have internal predecessors, (216), 0 states have call successors, (0), 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:19:51,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:19:51,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-11-07 19:19:51,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:19:53,171 INFO L124 PetriNetUnfolderBase]: 1328/2420 cut-off events. [2024-11-07 19:19:53,172 INFO L125 PetriNetUnfolderBase]: For 3663/3663 co-relation queries the response was YES. [2024-11-07 19:19:53,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7587 conditions, 2420 events. 1328/2420 cut-off events. For 3663/3663 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 14591 event pairs, 210 based on Foata normal form. 8/2357 useless extension candidates. Maximal degree in co-relation 7561. Up to 924 conditions per place. [2024-11-07 19:19:53,189 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 38 selfloop transitions, 8 changer transitions 86/149 dead transitions. [2024-11-07 19:19:53,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 149 transitions, 1066 flow [2024-11-07 19:19:53,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 19:19:53,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-07 19:19:53,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 338 transitions. [2024-11-07 19:19:53,191 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5007407407407407 [2024-11-07 19:19:53,191 INFO L175 Difference]: Start difference. First operand has 82 places, 62 transitions, 382 flow. Second operand 15 states and 338 transitions. [2024-11-07 19:19:53,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 149 transitions, 1066 flow [2024-11-07 19:19:53,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 149 transitions, 997 flow, removed 26 selfloop flow, removed 8 redundant places. [2024-11-07 19:19:53,206 INFO L231 Difference]: Finished difference. Result has 89 places, 48 transitions, 259 flow [2024-11-07 19:19:53,206 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=259, PETRI_PLACES=89, PETRI_TRANSITIONS=48} [2024-11-07 19:19:53,208 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 39 predicate places. [2024-11-07 19:19:53,208 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 48 transitions, 259 flow [2024-11-07 19:19:53,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 16.615384615384617) internal successors, (216), 13 states have internal predecessors, (216), 0 states have call successors, (0), 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:19:53,208 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:19:53,208 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] [2024-11-07 19:19:53,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 19:19:53,208 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:19:53,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:19:53,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1373434537, now seen corresponding path program 8 times [2024-11-07 19:19:53,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:19:53,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18684139] [2024-11-07 19:19:53,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:19:53,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:19:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:19:53,333 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:19:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:19:53,494 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 19:19:53,495 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:19:53,496 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-07 19:19:53,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-07 19:19:53,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-07 19:19:53,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-07 19:19:53,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-07 19:19:53,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-07 19:19:53,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-07 19:19:53,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 19:19:53,498 INFO L407 BasicCegarLoop]: Path program histogram: [8, 1, 1, 1, 1, 1] [2024-11-07 19:19:53,588 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 19:19:53,588 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 19:19:53,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:19:53 BasicIcfg [2024-11-07 19:19:53,594 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 19:19:53,595 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 19:19:53,595 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 19:19:53,595 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 19:19:53,596 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:19:30" (3/4) ... [2024-11-07 19:19:53,597 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 19:19:53,598 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 19:19:53,599 INFO L158 Benchmark]: Toolchain (without parser) took 25052.20ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 90.6MB in the beginning and 338.9MB in the end (delta: -248.3MB). Peak memory consumption was 390.0MB. Max. memory is 16.1GB. [2024-11-07 19:19:53,600 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 117.4MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:19:53,600 INFO L158 Benchmark]: CACSL2BoogieTranslator took 582.95ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 64.4MB in the end (delta: 26.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 19:19:53,601 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.42ms. Allocated memory is still 117.4MB. Free memory was 64.4MB in the beginning and 61.9MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 19:19:53,601 INFO L158 Benchmark]: Boogie Preprocessor took 77.55ms. Allocated memory is still 117.4MB. Free memory was 61.9MB in the beginning and 57.4MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:19:53,604 INFO L158 Benchmark]: RCFGBuilder took 890.80ms. Allocated memory is still 117.4MB. Free memory was 57.4MB in the beginning and 77.0MB in the end (delta: -19.6MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. [2024-11-07 19:19:53,604 INFO L158 Benchmark]: TraceAbstraction took 23423.64ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 76.4MB in the beginning and 339.0MB in the end (delta: -262.7MB). Peak memory consumption was 373.9MB. Max. memory is 16.1GB. [2024-11-07 19:19:53,604 INFO L158 Benchmark]: Witness Printer took 3.52ms. Allocated memory is still 755.0MB. Free memory was 339.0MB in the beginning and 338.9MB in the end (delta: 165.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:19:53,605 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 117.4MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 582.95ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 64.4MB in the end (delta: 26.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.42ms. Allocated memory is still 117.4MB. Free memory was 64.4MB in the beginning and 61.9MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.55ms. Allocated memory is still 117.4MB. Free memory was 61.9MB in the beginning and 57.4MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 890.80ms. Allocated memory is still 117.4MB. Free memory was 57.4MB in the beginning and 77.0MB in the end (delta: -19.6MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. * TraceAbstraction took 23423.64ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 76.4MB in the beginning and 339.0MB in the end (delta: -262.7MB). Peak memory consumption was 373.9MB. Max. memory is 16.1GB. * Witness Printer took 3.52ms. Allocated memory is still 755.0MB. Free memory was 339.0MB in the beginning and 338.9MB in the end (delta: 165.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$r_buff1_thd3; [L733] 0 _Bool y$read_delayed; [L734] 0 int *y$read_delayed_var; [L735] 0 int y$w_buff0; [L736] 0 _Bool y$w_buff0_used; [L737] 0 int y$w_buff1; [L738] 0 _Bool y$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2321; [L855] FCALL, FORK 0 pthread_create(&t2321, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2321=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L856] 0 pthread_t t2322; [L857] FCALL, FORK 0 pthread_create(&t2322, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2321=-2, t2322=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L858] 0 pthread_t t2323; [L859] FCALL, FORK 0 pthread_create(&t2323, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2321=-2, t2322=-1, t2323=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L796] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L813] 3 __unbuffered_p2_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L821] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L822] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L823] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L824] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L826] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 __unbuffered_p2_EBX = y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L832] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L744] 1 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L747] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L770] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321=-2, t2322=-1, t2323=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321=-2, t2322=-1, t2323=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321=-2, t2322=-1, t2323=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L18] 0 __assert_fail ("0", "safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 855]: 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: 859]: 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: 857]: 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 7 procedures, 70 locations, 7 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: 23.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 696 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 667 mSDsluCounter, 380 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 357 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2748 IncrementalHoareTripleChecker+Invalid, 2893 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 23 mSDtfsCounter, 2748 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=382occurred in iteration=11, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 329 NumberOfCodeBlocks, 329 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 286 ConstructedInterpolants, 0 QuantifiedInterpolants, 2627 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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:19:53,641 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 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/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.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 2b11be791089901ed5596869d293da40c27b85c1e89c21a55cf2181db7595687 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:19:55,979 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:19:56,084 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:19:56,093 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:19:56,093 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:19:56,113 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:19:56,114 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:19:56,114 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:19:56,115 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:19:56,115 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:19:56,116 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:19:56,116 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:19:56,116 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:19:56,117 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:19:56,117 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:19:56,117 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:19:56,118 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:19:56,118 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:19:56,118 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:19:56,118 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:19:56,118 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 19:19:56,118 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 19:19:56,118 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 19:19:56,118 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:19:56,118 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:19:56,118 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 19:19:56,119 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:19:56,119 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 19:19:56,119 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:19:56,119 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:19:56,119 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:19:56,119 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:19:56,119 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:19:56,120 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:19:56,120 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:19:56,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:19:56,121 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:19:56,121 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:19:56,121 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 19:19:56,121 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 19:19:56,121 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:19:56,121 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:19:56,121 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:19:56,122 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:19:56,122 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 -> 2b11be791089901ed5596869d293da40c27b85c1e89c21a55cf2181db7595687 [2024-11-07 19:19:56,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:19:56,425 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:19:56,427 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:19:56,428 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:19:56,430 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:19:56,432 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-07 19:19:57,809 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:19:58,128 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:19:58,129 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-07 19:19:58,150 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2eeacc504/960a43b164e74a7e9b13adb703a3dbd2/FLAG63d6ba59b [2024-11-07 19:19:58,169 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2eeacc504/960a43b164e74a7e9b13adb703a3dbd2 [2024-11-07 19:19:58,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:19:58,175 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:19:58,177 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:19:58,177 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:19:58,186 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:19:58,187 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:19:58" (1/1) ... [2024-11-07 19:19:58,188 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a461a58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:58, skipping insertion in model container [2024-11-07 19:19:58,188 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:19:58" (1/1) ... [2024-11-07 19:19:58,230 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:19:58,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:19:58,666 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:19:58,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:19:58,804 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:19:58,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:58 WrapperNode [2024-11-07 19:19:58,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:19:58,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:19:58,807 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:19:58,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:19:58,813 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:19:58" (1/1) ... [2024-11-07 19:19:58,833 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:19:58" (1/1) ... [2024-11-07 19:19:58,863 INFO L138 Inliner]: procedures = 176, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 139 [2024-11-07 19:19:58,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:19:58,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:19:58,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:19:58,865 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:19:58,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:58" (1/1) ... [2024-11-07 19:19:58,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:58" (1/1) ... [2024-11-07 19:19:58,879 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:58" (1/1) ... [2024-11-07 19:19:58,901 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:19:58,902 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:58" (1/1) ... [2024-11-07 19:19:58,902 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:58" (1/1) ... [2024-11-07 19:19:58,918 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:58" (1/1) ... [2024-11-07 19:19:58,924 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:58" (1/1) ... [2024-11-07 19:19:58,929 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:58" (1/1) ... [2024-11-07 19:19:58,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:19:58" (1/1) ... [2024-11-07 19:19:58,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:19:58,937 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:19:58,937 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:19:58,937 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:19:58,938 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:58" (1/1) ... [2024-11-07 19:19:58,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:19:58,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:19:58,972 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:19:58,976 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:19:58,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-07 19:19:58,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:19:58,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 19:19:58,999 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-07 19:19:58,999 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-07 19:19:58,999 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-07 19:19:59,000 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-07 19:19:59,000 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-07 19:19:59,000 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-07 19:19:59,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-07 19:19:59,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:19:59,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:19:59,001 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:19:59,156 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:19:59,157 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:19:59,560 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 19:19:59,560 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:19:59,802 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:19:59,802 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 19:19:59,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:19:59 BoogieIcfgContainer [2024-11-07 19:19:59,803 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:19:59,806 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:19:59,806 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:19:59,810 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:19:59,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:19:58" (1/3) ... [2024-11-07 19:19:59,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11b9fcc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:19:59, skipping insertion in model container [2024-11-07 19:19:59,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:58" (2/3) ... [2024-11-07 19:19:59,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11b9fcc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:19:59, skipping insertion in model container [2024-11-07 19:19:59,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:19:59" (3/3) ... [2024-11-07 19:19:59,813 INFO L112 eAbstractionObserver]: Analyzing ICFG safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-07 19:19:59,827 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:19:59,827 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-07 19:19:59,827 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 19:19:59,893 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 19:19:59,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 102 flow [2024-11-07 19:19:59,958 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2024-11-07 19:19:59,960 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:19:59,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 42 events. 2/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-11-07 19:19:59,968 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 45 transitions, 102 flow [2024-11-07 19:19:59,971 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 42 transitions, 93 flow [2024-11-07 19:19:59,979 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:19:59,989 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;@4ccce089, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:19:59,990 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-07 19:19:59,994 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:19:59,994 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-07 19:19:59,994 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:19:59,995 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:19:59,995 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 19:19:59,995 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:19:59,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:00,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1133931806, now seen corresponding path program 1 times [2024-11-07 19:20:00,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:00,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [225705426] [2024-11-07 19:20:00,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:00,010 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:20:00,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:00,014 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:20:00,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 19:20:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:00,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 19:20:00,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:00,178 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:20:00,178 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:00,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:00,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [225705426] [2024-11-07 19:20:00,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [225705426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:00,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:00,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:20:00,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358530619] [2024-11-07 19:20:00,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:00,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:20:00,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:00,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:20:00,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:20:00,219 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-07 19:20:00,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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:20:00,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:00,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-07 19:20:00,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:00,994 INFO L124 PetriNetUnfolderBase]: 1647/2922 cut-off events. [2024-11-07 19:20:00,994 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-11-07 19:20:01,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5397 conditions, 2922 events. 1647/2922 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 19368 event pairs, 276 based on Foata normal form. 160/3066 useless extension candidates. Maximal degree in co-relation 5386. Up to 1942 conditions per place. [2024-11-07 19:20:01,028 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 37 selfloop transitions, 2 changer transitions 2/55 dead transitions. [2024-11-07 19:20:01,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 55 transitions, 204 flow [2024-11-07 19:20:01,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:20:01,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:20:01,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-11-07 19:20:01,043 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7185185185185186 [2024-11-07 19:20:01,045 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 93 flow. Second operand 3 states and 97 transitions. [2024-11-07 19:20:01,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 55 transitions, 204 flow [2024-11-07 19:20:01,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 200 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 19:20:01,056 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 84 flow [2024-11-07 19:20:01,060 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-11-07 19:20:01,064 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2024-11-07 19:20:01,064 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 84 flow [2024-11-07 19:20:01,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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:20:01,064 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:01,064 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:20:01,070 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:20:01,265 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:20:01,265 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:01,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:01,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1710980197, now seen corresponding path program 1 times [2024-11-07 19:20:01,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:01,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [679202598] [2024-11-07 19:20:01,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:01,267 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:20:01,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:01,270 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:20:01,271 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:20:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:01,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:20:01,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:01,415 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:20:01,416 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:01,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:01,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [679202598] [2024-11-07 19:20:01,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [679202598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:01,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:01,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:20:01,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916042235] [2024-11-07 19:20:01,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:01,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:20:01,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:01,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:20:01,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:20:01,427 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-11-07 19:20:01,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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:20:01,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:01,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-11-07 19:20:01,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:02,128 INFO L124 PetriNetUnfolderBase]: 2739/4534 cut-off events. [2024-11-07 19:20:02,129 INFO L125 PetriNetUnfolderBase]: For 228/228 co-relation queries the response was YES. [2024-11-07 19:20:02,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8900 conditions, 4534 events. 2739/4534 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 28583 event pairs, 330 based on Foata normal form. 150/4653 useless extension candidates. Maximal degree in co-relation 8890. Up to 2598 conditions per place. [2024-11-07 19:20:02,158 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 50 selfloop transitions, 5 changer transitions 1/66 dead transitions. [2024-11-07 19:20:02,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 66 transitions, 262 flow [2024-11-07 19:20:02,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:20:02,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:20:02,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2024-11-07 19:20:02,160 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2024-11-07 19:20:02,161 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 84 flow. Second operand 4 states and 110 transitions. [2024-11-07 19:20:02,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 66 transitions, 262 flow [2024-11-07 19:20:02,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 66 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:20:02,165 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 114 flow [2024-11-07 19:20:02,166 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2024-11-07 19:20:02,166 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2024-11-07 19:20:02,167 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 114 flow [2024-11-07 19:20:02,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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:20:02,168 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:02,168 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:20:02,172 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:20:02,368 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:20:02,369 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:02,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:02,370 INFO L85 PathProgramCache]: Analyzing trace with hash 25598747, now seen corresponding path program 1 times [2024-11-07 19:20:02,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:02,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1041075885] [2024-11-07 19:20:02,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:02,371 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:20:02,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:02,375 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:20:02,376 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:20:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:02,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 19:20:02,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:02,525 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:20:02,525 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:02,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:02,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1041075885] [2024-11-07 19:20:02,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1041075885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:02,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:02,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:20:02,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172169002] [2024-11-07 19:20:02,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:02,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:20:02,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:02,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:20:02,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:20:02,541 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-11-07 19:20:02,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:20:02,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:02,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-11-07 19:20:02,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:03,105 INFO L124 PetriNetUnfolderBase]: 1542/2575 cut-off events. [2024-11-07 19:20:03,105 INFO L125 PetriNetUnfolderBase]: For 505/505 co-relation queries the response was YES. [2024-11-07 19:20:03,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5756 conditions, 2575 events. 1542/2575 cut-off events. For 505/505 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 14012 event pairs, 200 based on Foata normal form. 114/2664 useless extension candidates. Maximal degree in co-relation 5744. Up to 981 conditions per place. [2024-11-07 19:20:03,118 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 63 selfloop transitions, 8 changer transitions 1/82 dead transitions. [2024-11-07 19:20:03,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 82 transitions, 363 flow [2024-11-07 19:20:03,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:20:03,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:20:03,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2024-11-07 19:20:03,122 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6177777777777778 [2024-11-07 19:20:03,122 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 114 flow. Second operand 5 states and 139 transitions. [2024-11-07 19:20:03,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 82 transitions, 363 flow [2024-11-07 19:20:03,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 82 transitions, 353 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-07 19:20:03,127 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 154 flow [2024-11-07 19:20:03,128 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2024-11-07 19:20:03,129 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2024-11-07 19:20:03,129 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 154 flow [2024-11-07 19:20:03,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:20:03,129 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:03,129 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:20:03,134 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:20:03,329 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:20:03,330 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:03,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:03,330 INFO L85 PathProgramCache]: Analyzing trace with hash 271636870, now seen corresponding path program 1 times [2024-11-07 19:20:03,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:03,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524245169] [2024-11-07 19:20:03,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:03,331 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:20:03,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:03,334 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:20:03,336 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:20:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:03,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 19:20:03,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:03,509 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:20:03,509 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:03,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:03,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1524245169] [2024-11-07 19:20:03,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1524245169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:03,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:03,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:20:03,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315665528] [2024-11-07 19:20:03,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:03,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:20:03,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:03,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:20:03,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:20:03,517 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-11-07 19:20:03,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 154 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 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:20:03,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:03,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-11-07 19:20:03,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:03,894 INFO L124 PetriNetUnfolderBase]: 857/1384 cut-off events. [2024-11-07 19:20:03,894 INFO L125 PetriNetUnfolderBase]: For 914/914 co-relation queries the response was YES. [2024-11-07 19:20:03,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3502 conditions, 1384 events. 857/1384 cut-off events. For 914/914 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6327 event pairs, 175 based on Foata normal form. 48/1407 useless extension candidates. Maximal degree in co-relation 3488. Up to 466 conditions per place. [2024-11-07 19:20:03,905 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 54 selfloop transitions, 11 changer transitions 1/76 dead transitions. [2024-11-07 19:20:03,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 76 transitions, 362 flow [2024-11-07 19:20:03,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:20:03,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:20:03,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2024-11-07 19:20:03,909 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5407407407407407 [2024-11-07 19:20:03,909 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 154 flow. Second operand 6 states and 146 transitions. [2024-11-07 19:20:03,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 76 transitions, 362 flow [2024-11-07 19:20:03,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 76 transitions, 337 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-07 19:20:03,920 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 168 flow [2024-11-07 19:20:03,920 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=168, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2024-11-07 19:20:03,922 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2024-11-07 19:20:03,922 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 168 flow [2024-11-07 19:20:03,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 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:20:03,923 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:03,923 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] [2024-11-07 19:20:03,928 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:20:04,127 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:20:04,127 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:04,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:04,128 INFO L85 PathProgramCache]: Analyzing trace with hash -2124466649, now seen corresponding path program 1 times [2024-11-07 19:20:04,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:04,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552143064] [2024-11-07 19:20:04,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:04,129 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:20:04,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:04,131 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:20:04,132 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:20:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:04,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 19:20:04,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:04,314 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:20:04,314 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:04,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:04,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552143064] [2024-11-07 19:20:04,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1552143064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:04,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:04,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:20:04,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510462645] [2024-11-07 19:20:04,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:04,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:20:04,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:04,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:20:04,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:20:04,321 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-07 19:20:04,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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:20:04,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:04,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-07 19:20:04,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:04,466 INFO L124 PetriNetUnfolderBase]: 498/923 cut-off events. [2024-11-07 19:20:04,466 INFO L125 PetriNetUnfolderBase]: For 396/400 co-relation queries the response was YES. [2024-11-07 19:20:04,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2159 conditions, 923 events. 498/923 cut-off events. For 396/400 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4641 event pairs, 464 based on Foata normal form. 8/887 useless extension candidates. Maximal degree in co-relation 2144. Up to 751 conditions per place. [2024-11-07 19:20:04,473 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 21 selfloop transitions, 1 changer transitions 1/42 dead transitions. [2024-11-07 19:20:04,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 42 transitions, 212 flow [2024-11-07 19:20:04,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:20:04,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:20:04,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2024-11-07 19:20:04,474 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-11-07 19:20:04,474 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 168 flow. Second operand 3 states and 72 transitions. [2024-11-07 19:20:04,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 42 transitions, 212 flow [2024-11-07 19:20:04,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 42 transitions, 156 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-11-07 19:20:04,478 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 110 flow [2024-11-07 19:20:04,479 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2024-11-07 19:20:04,479 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2024-11-07 19:20:04,479 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 110 flow [2024-11-07 19:20:04,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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:20:04,480 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:04,480 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] [2024-11-07 19:20:04,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-07 19:20:04,684 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:20:04,685 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:04,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:04,685 INFO L85 PathProgramCache]: Analyzing trace with hash -54817177, now seen corresponding path program 1 times [2024-11-07 19:20:04,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:04,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1330295099] [2024-11-07 19:20:04,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:04,686 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:20:04,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:04,688 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:20:04,691 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:20:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:04,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 19:20:04,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:05,350 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:20:05,350 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:05,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:05,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1330295099] [2024-11-07 19:20:05,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1330295099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:05,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:05,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 19:20:05,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304687480] [2024-11-07 19:20:05,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:05,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 19:20:05,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:05,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 19:20:05,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 19:20:05,362 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-07 19:20:05,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 110 flow. Second operand has 8 states, 8 states have (on average 18.5) internal successors, (148), 8 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:20:05,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:05,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-07 19:20:05,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:05,916 INFO L124 PetriNetUnfolderBase]: 1233/2279 cut-off events. [2024-11-07 19:20:05,917 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:20:05,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4530 conditions, 2279 events. 1233/2279 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 14086 event pairs, 350 based on Foata normal form. 8/2211 useless extension candidates. Maximal degree in co-relation 4523. Up to 799 conditions per place. [2024-11-07 19:20:05,928 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 37 selfloop transitions, 11 changer transitions 30/96 dead transitions. [2024-11-07 19:20:05,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 96 transitions, 380 flow [2024-11-07 19:20:05,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 19:20:05,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 19:20:05,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 223 transitions. [2024-11-07 19:20:05,930 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5506172839506173 [2024-11-07 19:20:05,930 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 110 flow. Second operand 9 states and 223 transitions. [2024-11-07 19:20:05,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 96 transitions, 380 flow [2024-11-07 19:20:05,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 96 transitions, 379 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:20:05,932 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 184 flow [2024-11-07 19:20:05,933 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=184, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2024-11-07 19:20:05,933 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2024-11-07 19:20:05,933 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 184 flow [2024-11-07 19:20:05,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.5) internal successors, (148), 8 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:20:05,934 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:05,934 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] [2024-11-07 19:20:05,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-07 19:20:06,137 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:20:06,138 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:06,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:06,138 INFO L85 PathProgramCache]: Analyzing trace with hash -911523969, now seen corresponding path program 2 times [2024-11-07 19:20:06,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:06,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835279827] [2024-11-07 19:20:06,139 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 19:20:06,139 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:20:06,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:06,141 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:20:06,142 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:20:06,259 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 19:20:06,259 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:20:06,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 19:20:06,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:06,342 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:20:06,342 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:06,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:06,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835279827] [2024-11-07 19:20:06,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1835279827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:06,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:06,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:20:06,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343330765] [2024-11-07 19:20:06,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:06,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:20:06,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:06,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:20:06,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:20:06,354 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-11-07 19:20:06,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 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:20:06,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:06,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-11-07 19:20:06,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:06,870 INFO L124 PetriNetUnfolderBase]: 1759/3104 cut-off events. [2024-11-07 19:20:06,871 INFO L125 PetriNetUnfolderBase]: For 908/930 co-relation queries the response was YES. [2024-11-07 19:20:06,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7628 conditions, 3104 events. 1759/3104 cut-off events. For 908/930 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 19468 event pairs, 412 based on Foata normal form. 28/3018 useless extension candidates. Maximal degree in co-relation 7614. Up to 1206 conditions per place. [2024-11-07 19:20:06,890 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 53 selfloop transitions, 3 changer transitions 18/92 dead transitions. [2024-11-07 19:20:06,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 92 transitions, 478 flow [2024-11-07 19:20:06,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:20:06,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:20:06,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2024-11-07 19:20:06,892 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5407407407407407 [2024-11-07 19:20:06,892 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 184 flow. Second operand 6 states and 146 transitions. [2024-11-07 19:20:06,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 92 transitions, 478 flow [2024-11-07 19:20:06,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 461 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-11-07 19:20:06,895 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 187 flow [2024-11-07 19:20:06,895 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2024-11-07 19:20:06,896 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2024-11-07 19:20:06,896 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 187 flow [2024-11-07 19:20:06,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 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:20:06,896 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:06,896 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] [2024-11-07 19:20:06,902 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:20:07,100 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:20:07,101 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:07,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:07,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1554195995, now seen corresponding path program 3 times [2024-11-07 19:20:07,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:07,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [471295137] [2024-11-07 19:20:07,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 19:20:07,102 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:20:07,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:07,106 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:20:07,107 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:20:07,218 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-07 19:20:07,218 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:20:07,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-07 19:20:07,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:07,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:20:07,595 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:07,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:07,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [471295137] [2024-11-07 19:20:07,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [471295137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:07,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:07,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 19:20:07,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765392501] [2024-11-07 19:20:07,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:07,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 19:20:07,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:07,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 19:20:07,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-07 19:20:07,610 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-07 19:20:07,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 187 flow. Second operand has 10 states, 10 states have (on average 18.0) internal successors, (180), 10 states have internal predecessors, (180), 0 states have call successors, (0), 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:20:07,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:07,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-07 19:20:07,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:08,105 INFO L124 PetriNetUnfolderBase]: 904/1722 cut-off events. [2024-11-07 19:20:08,105 INFO L125 PetriNetUnfolderBase]: For 462/474 co-relation queries the response was YES. [2024-11-07 19:20:08,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4209 conditions, 1722 events. 904/1722 cut-off events. For 462/474 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9746 event pairs, 216 based on Foata normal form. 14/1696 useless extension candidates. Maximal degree in co-relation 4195. Up to 871 conditions per place. [2024-11-07 19:20:08,118 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 47 selfloop transitions, 8 changer transitions 27/100 dead transitions. [2024-11-07 19:20:08,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 100 transitions, 503 flow [2024-11-07 19:20:08,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 19:20:08,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-07 19:20:08,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 233 transitions. [2024-11-07 19:20:08,120 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5177777777777778 [2024-11-07 19:20:08,120 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 187 flow. Second operand 10 states and 233 transitions. [2024-11-07 19:20:08,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 100 transitions, 503 flow [2024-11-07 19:20:08,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 100 transitions, 487 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-07 19:20:08,123 INFO L231 Difference]: Finished difference. Result has 69 places, 55 transitions, 243 flow [2024-11-07 19:20:08,124 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=243, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2024-11-07 19:20:08,124 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 19 predicate places. [2024-11-07 19:20:08,124 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 55 transitions, 243 flow [2024-11-07 19:20:08,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.0) internal successors, (180), 10 states have internal predecessors, (180), 0 states have call successors, (0), 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:20:08,125 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:08,125 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] [2024-11-07 19:20:08,130 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:20:08,325 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:20:08,325 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:08,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:08,326 INFO L85 PathProgramCache]: Analyzing trace with hash 75936345, now seen corresponding path program 4 times [2024-11-07 19:20:08,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:08,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893051758] [2024-11-07 19:20:08,326 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-07 19:20:08,326 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:20:08,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:08,328 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:20:08,329 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:20:08,431 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-07 19:20:08,431 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:20:08,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 19:20:08,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:08,735 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:20:08,735 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:08,735 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:08,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893051758] [2024-11-07 19:20:08,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [893051758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:08,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:08,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 19:20:08,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682084470] [2024-11-07 19:20:08,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:08,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 19:20:08,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:08,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 19:20:08,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 19:20:08,746 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-07 19:20:08,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 55 transitions, 243 flow. Second operand has 8 states, 8 states have (on average 18.5) internal successors, (148), 8 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:20:08,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:08,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-07 19:20:08,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:09,266 INFO L124 PetriNetUnfolderBase]: 1090/2089 cut-off events. [2024-11-07 19:20:09,266 INFO L125 PetriNetUnfolderBase]: For 1412/1444 co-relation queries the response was YES. [2024-11-07 19:20:09,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5442 conditions, 2089 events. 1090/2089 cut-off events. For 1412/1444 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 12354 event pairs, 341 based on Foata normal form. 28/2056 useless extension candidates. Maximal degree in co-relation 5424. Up to 623 conditions per place. [2024-11-07 19:20:09,276 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 56 selfloop transitions, 10 changer transitions 25/109 dead transitions. [2024-11-07 19:20:09,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 109 transitions, 621 flow [2024-11-07 19:20:09,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 19:20:09,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 19:20:09,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 208 transitions. [2024-11-07 19:20:09,278 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2024-11-07 19:20:09,278 INFO L175 Difference]: Start difference. First operand has 69 places, 55 transitions, 243 flow. Second operand 8 states and 208 transitions. [2024-11-07 19:20:09,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 109 transitions, 621 flow [2024-11-07 19:20:09,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 109 transitions, 582 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-11-07 19:20:09,283 INFO L231 Difference]: Finished difference. Result has 73 places, 56 transitions, 285 flow [2024-11-07 19:20:09,283 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=285, PETRI_PLACES=73, PETRI_TRANSITIONS=56} [2024-11-07 19:20:09,283 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 23 predicate places. [2024-11-07 19:20:09,284 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 56 transitions, 285 flow [2024-11-07 19:20:09,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.5) internal successors, (148), 8 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:20:09,284 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:09,284 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] [2024-11-07 19:20:09,289 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:20:09,487 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:20:09,488 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:09,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:09,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1632386627, now seen corresponding path program 5 times [2024-11-07 19:20:09,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:09,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255496063] [2024-11-07 19:20:09,489 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-07 19:20:09,489 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:09,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:09,492 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:20:09,499 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:20:09,594 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 19:20:09,594 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:20:09,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 19:20:09,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:09,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:20:09,891 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:09,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:09,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255496063] [2024-11-07 19:20:09,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [255496063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:09,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:09,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 19:20:09,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345231639] [2024-11-07 19:20:09,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:09,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 19:20:09,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:09,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 19:20:09,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-07 19:20:09,908 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-07 19:20:09,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 56 transitions, 285 flow. Second operand has 10 states, 10 states have (on average 18.0) internal successors, (180), 10 states have internal predecessors, (180), 0 states have call successors, (0), 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:20:09,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:09,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-07 19:20:09,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:10,446 INFO L124 PetriNetUnfolderBase]: 1124/2090 cut-off events. [2024-11-07 19:20:10,446 INFO L125 PetriNetUnfolderBase]: For 2528/2624 co-relation queries the response was YES. [2024-11-07 19:20:10,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5845 conditions, 2090 events. 1124/2090 cut-off events. For 2528/2624 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 11888 event pairs, 368 based on Foata normal form. 20/2063 useless extension candidates. Maximal degree in co-relation 5825. Up to 1275 conditions per place. [2024-11-07 19:20:10,460 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 55 selfloop transitions, 9 changer transitions 27/109 dead transitions. [2024-11-07 19:20:10,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 109 transitions, 679 flow [2024-11-07 19:20:10,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 19:20:10,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-07 19:20:10,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 235 transitions. [2024-11-07 19:20:10,461 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2024-11-07 19:20:10,461 INFO L175 Difference]: Start difference. First operand has 73 places, 56 transitions, 285 flow. Second operand 10 states and 235 transitions. [2024-11-07 19:20:10,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 109 transitions, 679 flow [2024-11-07 19:20:10,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 109 transitions, 651 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-11-07 19:20:10,467 INFO L231 Difference]: Finished difference. Result has 79 places, 59 transitions, 342 flow [2024-11-07 19:20:10,468 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=342, PETRI_PLACES=79, PETRI_TRANSITIONS=59} [2024-11-07 19:20:10,469 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 29 predicate places. [2024-11-07 19:20:10,469 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 59 transitions, 342 flow [2024-11-07 19:20:10,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.0) internal successors, (180), 10 states have internal predecessors, (180), 0 states have call successors, (0), 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:20:10,470 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:10,470 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] [2024-11-07 19:20:10,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-07 19:20:10,670 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:20:10,671 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:10,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:10,671 INFO L85 PathProgramCache]: Analyzing trace with hash -694550067, now seen corresponding path program 6 times [2024-11-07 19:20:10,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:10,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326052749] [2024-11-07 19:20:10,672 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-07 19:20:10,672 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:20:10,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:10,674 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:20:10,675 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:20:10,765 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-07 19:20:10,765 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:20:10,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 19:20:10,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:10,943 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:20:10,944 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:10,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:10,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326052749] [2024-11-07 19:20:10,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1326052749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:10,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:10,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 19:20:10,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672773979] [2024-11-07 19:20:10,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:10,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 19:20:10,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:10,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 19:20:10,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 19:20:10,962 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-07 19:20:10,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 59 transitions, 342 flow. Second operand has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 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:20:10,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:10,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-07 19:20:10,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:11,370 INFO L124 PetriNetUnfolderBase]: 1150/2148 cut-off events. [2024-11-07 19:20:11,370 INFO L125 PetriNetUnfolderBase]: For 3478/3522 co-relation queries the response was YES. [2024-11-07 19:20:11,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6235 conditions, 2148 events. 1150/2148 cut-off events. For 3478/3522 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 12389 event pairs, 454 based on Foata normal form. 12/2110 useless extension candidates. Maximal degree in co-relation 6211. Up to 1279 conditions per place. [2024-11-07 19:20:11,381 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 45 selfloop transitions, 5 changer transitions 30/98 dead transitions. [2024-11-07 19:20:11,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 98 transitions, 651 flow [2024-11-07 19:20:11,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 19:20:11,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 19:20:11,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 209 transitions. [2024-11-07 19:20:11,382 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5160493827160494 [2024-11-07 19:20:11,382 INFO L175 Difference]: Start difference. First operand has 79 places, 59 transitions, 342 flow. Second operand 9 states and 209 transitions. [2024-11-07 19:20:11,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 98 transitions, 651 flow [2024-11-07 19:20:11,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 98 transitions, 618 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-11-07 19:20:11,388 INFO L231 Difference]: Finished difference. Result has 83 places, 57 transitions, 323 flow [2024-11-07 19:20:11,388 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=323, PETRI_PLACES=83, PETRI_TRANSITIONS=57} [2024-11-07 19:20:11,389 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2024-11-07 19:20:11,389 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 57 transitions, 323 flow [2024-11-07 19:20:11,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 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:20:11,389 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:11,389 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] [2024-11-07 19:20:11,393 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:20:11,589 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:20:11,590 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:11,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:11,590 INFO L85 PathProgramCache]: Analyzing trace with hash 336954901, now seen corresponding path program 7 times [2024-11-07 19:20:11,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:11,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772482387] [2024-11-07 19:20:11,590 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-07 19:20:11,590 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:20:11,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:11,592 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:20:11,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-07 19:20:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:11,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 19:20:11,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:11,882 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:20:11,882 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:11,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:11,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772482387] [2024-11-07 19:20:11,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772482387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:11,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:11,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 19:20:11,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972548816] [2024-11-07 19:20:11,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:11,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 19:20:11,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:11,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 19:20:11,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 19:20:11,895 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-07 19:20:11,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 57 transitions, 323 flow. Second operand has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 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:20:11,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:11,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-07 19:20:11,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:12,284 INFO L124 PetriNetUnfolderBase]: 1034/1940 cut-off events. [2024-11-07 19:20:12,284 INFO L125 PetriNetUnfolderBase]: For 2602/2656 co-relation queries the response was YES. [2024-11-07 19:20:12,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5388 conditions, 1940 events. 1034/1940 cut-off events. For 2602/2656 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10961 event pairs, 437 based on Foata normal form. 10/1898 useless extension candidates. Maximal degree in co-relation 5361. Up to 1181 conditions per place. [2024-11-07 19:20:12,295 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 34 selfloop transitions, 2 changer transitions 44/98 dead transitions. [2024-11-07 19:20:12,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 98 transitions, 632 flow [2024-11-07 19:20:12,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 19:20:12,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 19:20:12,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 212 transitions. [2024-11-07 19:20:12,297 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5234567901234568 [2024-11-07 19:20:12,297 INFO L175 Difference]: Start difference. First operand has 83 places, 57 transitions, 323 flow. Second operand 9 states and 212 transitions. [2024-11-07 19:20:12,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 98 transitions, 632 flow [2024-11-07 19:20:12,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 98 transitions, 611 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-11-07 19:20:12,303 INFO L231 Difference]: Finished difference. Result has 85 places, 51 transitions, 260 flow [2024-11-07 19:20:12,303 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=260, PETRI_PLACES=85, PETRI_TRANSITIONS=51} [2024-11-07 19:20:12,305 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 35 predicate places. [2024-11-07 19:20:12,306 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 51 transitions, 260 flow [2024-11-07 19:20:12,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 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:20:12,306 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:12,307 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] [2024-11-07 19:20:12,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-07 19:20:12,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:12,507 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:12,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:12,508 INFO L85 PathProgramCache]: Analyzing trace with hash 367094421, now seen corresponding path program 8 times [2024-11-07 19:20:12,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:12,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2114853612] [2024-11-07 19:20:12,508 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 19:20:12,508 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:20:12,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:12,512 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:20:12,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-07 19:20:12,616 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 19:20:12,616 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:20:12,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-07 19:20:12,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:13,255 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:20:13,255 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:13,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:13,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2114853612] [2024-11-07 19:20:13,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2114853612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:13,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:13,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 19:20:13,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599857654] [2024-11-07 19:20:13,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:13,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 19:20:13,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:13,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 19:20:13,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-07 19:20:13,275 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-07 19:20:13,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 51 transitions, 260 flow. Second operand has 10 states, 10 states have (on average 18.0) internal successors, (180), 10 states have internal predecessors, (180), 0 states have call successors, (0), 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:20:13,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:13,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-07 19:20:13,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:13,898 INFO L124 PetriNetUnfolderBase]: 1280/2386 cut-off events. [2024-11-07 19:20:13,898 INFO L125 PetriNetUnfolderBase]: For 2418/2462 co-relation queries the response was YES. [2024-11-07 19:20:13,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6057 conditions, 2386 events. 1280/2386 cut-off events. For 2418/2462 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 14755 event pairs, 414 based on Foata normal form. 14/2314 useless extension candidates. Maximal degree in co-relation 6029. Up to 967 conditions per place. [2024-11-07 19:20:13,915 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 50 selfloop transitions, 15 changer transitions 35/118 dead transitions. [2024-11-07 19:20:13,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 118 transitions, 692 flow [2024-11-07 19:20:13,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 19:20:13,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-07 19:20:13,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 283 transitions. [2024-11-07 19:20:13,919 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.524074074074074 [2024-11-07 19:20:13,920 INFO L175 Difference]: Start difference. First operand has 85 places, 51 transitions, 260 flow. Second operand 12 states and 283 transitions. [2024-11-07 19:20:13,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 118 transitions, 692 flow [2024-11-07 19:20:13,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 118 transitions, 628 flow, removed 28 selfloop flow, removed 13 redundant places. [2024-11-07 19:20:13,928 INFO L231 Difference]: Finished difference. Result has 80 places, 57 transitions, 320 flow [2024-11-07 19:20:13,928 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=320, PETRI_PLACES=80, PETRI_TRANSITIONS=57} [2024-11-07 19:20:13,929 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 30 predicate places. [2024-11-07 19:20:13,929 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 57 transitions, 320 flow [2024-11-07 19:20:13,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.0) internal successors, (180), 10 states have internal predecessors, (180), 0 states have call successors, (0), 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:20:13,929 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:13,929 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] [2024-11-07 19:20:13,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-07 19:20:14,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:14,130 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:14,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:14,131 INFO L85 PathProgramCache]: Analyzing trace with hash -2072803385, now seen corresponding path program 9 times [2024-11-07 19:20:14,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:14,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1520530161] [2024-11-07 19:20:14,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 19:20:14,131 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:20:14,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:14,133 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:20:14,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-07 19:20:14,231 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-07 19:20:14,232 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:20:14,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 19:20:14,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:14,443 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:20:14,443 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:14,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:14,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1520530161] [2024-11-07 19:20:14,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1520530161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:14,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:14,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 19:20:14,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656022904] [2024-11-07 19:20:14,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:14,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 19:20:14,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:14,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 19:20:14,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 19:20:14,454 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-07 19:20:14,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 57 transitions, 320 flow. Second operand has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 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:20:14,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:14,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-07 19:20:14,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:14,910 INFO L124 PetriNetUnfolderBase]: 1292/2364 cut-off events. [2024-11-07 19:20:14,910 INFO L125 PetriNetUnfolderBase]: For 2042/2078 co-relation queries the response was YES. [2024-11-07 19:20:14,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6189 conditions, 2364 events. 1292/2364 cut-off events. For 2042/2078 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 14633 event pairs, 308 based on Foata normal form. 18/2280 useless extension candidates. Maximal degree in co-relation 6165. Up to 683 conditions per place. [2024-11-07 19:20:14,925 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 36 selfloop transitions, 8 changer transitions 44/106 dead transitions. [2024-11-07 19:20:14,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 106 transitions, 681 flow [2024-11-07 19:20:14,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 19:20:14,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 19:20:14,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 214 transitions. [2024-11-07 19:20:14,926 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.528395061728395 [2024-11-07 19:20:14,926 INFO L175 Difference]: Start difference. First operand has 80 places, 57 transitions, 320 flow. Second operand 9 states and 214 transitions. [2024-11-07 19:20:14,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 106 transitions, 681 flow [2024-11-07 19:20:14,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 106 transitions, 625 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-11-07 19:20:14,933 INFO L231 Difference]: Finished difference. Result has 81 places, 51 transitions, 250 flow [2024-11-07 19:20:14,933 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=250, PETRI_PLACES=81, PETRI_TRANSITIONS=51} [2024-11-07 19:20:14,934 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 31 predicate places. [2024-11-07 19:20:14,934 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 51 transitions, 250 flow [2024-11-07 19:20:14,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 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:20:14,934 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:14,934 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] [2024-11-07 19:20:14,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-07 19:20:15,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:15,135 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:15,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:15,135 INFO L85 PathProgramCache]: Analyzing trace with hash -523130289, now seen corresponding path program 10 times [2024-11-07 19:20:15,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:15,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651567755] [2024-11-07 19:20:15,136 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-07 19:20:15,136 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:20:15,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:15,140 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:20:15,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-07 19:20:15,230 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-07 19:20:15,230 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:20:15,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-07 19:20:15,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:15,781 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:20:15,781 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:15,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:15,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1651567755] [2024-11-07 19:20:15,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1651567755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:15,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:15,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 19:20:15,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52343930] [2024-11-07 19:20:15,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:15,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 19:20:15,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:15,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 19:20:15,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-07 19:20:15,792 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-07 19:20:15,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 51 transitions, 250 flow. Second operand has 10 states, 10 states have (on average 18.0) internal successors, (180), 10 states have internal predecessors, (180), 0 states have call successors, (0), 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:20:15,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:15,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-07 19:20:15,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:16,087 INFO L124 PetriNetUnfolderBase]: 703/1306 cut-off events. [2024-11-07 19:20:16,087 INFO L125 PetriNetUnfolderBase]: For 734/734 co-relation queries the response was YES. [2024-11-07 19:20:16,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3208 conditions, 1306 events. 703/1306 cut-off events. For 734/734 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 7269 event pairs, 238 based on Foata normal form. 8/1250 useless extension candidates. Maximal degree in co-relation 3184. Up to 486 conditions per place. [2024-11-07 19:20:16,094 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 30 selfloop transitions, 4 changer transitions 26/78 dead transitions. [2024-11-07 19:20:16,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 78 transitions, 440 flow [2024-11-07 19:20:16,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 19:20:16,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 19:20:16,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 182 transitions. [2024-11-07 19:20:16,096 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5055555555555555 [2024-11-07 19:20:16,096 INFO L175 Difference]: Start difference. First operand has 81 places, 51 transitions, 250 flow. Second operand 8 states and 182 transitions. [2024-11-07 19:20:16,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 78 transitions, 440 flow [2024-11-07 19:20:16,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 78 transitions, 374 flow, removed 15 selfloop flow, removed 17 redundant places. [2024-11-07 19:20:16,099 INFO L231 Difference]: Finished difference. Result has 71 places, 45 transitions, 173 flow [2024-11-07 19:20:16,099 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=173, PETRI_PLACES=71, PETRI_TRANSITIONS=45} [2024-11-07 19:20:16,099 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 21 predicate places. [2024-11-07 19:20:16,100 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 45 transitions, 173 flow [2024-11-07 19:20:16,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.0) internal successors, (180), 10 states have internal predecessors, (180), 0 states have call successors, (0), 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:20:16,100 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:16,100 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] [2024-11-07 19:20:16,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-07 19:20:16,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:16,301 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:16,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:16,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1169989309, now seen corresponding path program 11 times [2024-11-07 19:20:16,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:16,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1515805300] [2024-11-07 19:20:16,301 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-07 19:20:16,301 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:20:16,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:16,303 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:20:16,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-07 19:20:16,387 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 19:20:16,387 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:20:16,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-07 19:20:16,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:16,620 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:20:16,621 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:16,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:16,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1515805300] [2024-11-07 19:20:16,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1515805300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:16,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:16,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 19:20:16,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850238130] [2024-11-07 19:20:16,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:16,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 19:20:16,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:16,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 19:20:16,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-07 19:20:16,638 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-07 19:20:16,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 45 transitions, 173 flow. Second operand has 10 states, 10 states have (on average 18.0) internal successors, (180), 10 states have internal predecessors, (180), 0 states have call successors, (0), 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:20:16,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:16,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-07 19:20:16,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:16,929 INFO L124 PetriNetUnfolderBase]: 694/1324 cut-off events. [2024-11-07 19:20:16,929 INFO L125 PetriNetUnfolderBase]: For 274/274 co-relation queries the response was YES. [2024-11-07 19:20:16,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2956 conditions, 1324 events. 694/1324 cut-off events. For 274/274 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 7749 event pairs, 200 based on Foata normal form. 8/1266 useless extension candidates. Maximal degree in co-relation 2939. Up to 368 conditions per place. [2024-11-07 19:20:16,934 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 35 selfloop transitions, 7 changer transitions 24/84 dead transitions. [2024-11-07 19:20:16,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 84 transitions, 415 flow [2024-11-07 19:20:16,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 19:20:16,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 19:20:16,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 207 transitions. [2024-11-07 19:20:16,936 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2024-11-07 19:20:16,936 INFO L175 Difference]: Start difference. First operand has 71 places, 45 transitions, 173 flow. Second operand 9 states and 207 transitions. [2024-11-07 19:20:16,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 84 transitions, 415 flow [2024-11-07 19:20:16,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 84 transitions, 372 flow, removed 11 selfloop flow, removed 12 redundant places. [2024-11-07 19:20:16,939 INFO L231 Difference]: Finished difference. Result has 67 places, 48 transitions, 189 flow [2024-11-07 19:20:16,939 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=189, PETRI_PLACES=67, PETRI_TRANSITIONS=48} [2024-11-07 19:20:16,940 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 17 predicate places. [2024-11-07 19:20:16,940 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 48 transitions, 189 flow [2024-11-07 19:20:16,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.0) internal successors, (180), 10 states have internal predecessors, (180), 0 states have call successors, (0), 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:20:16,940 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:16,940 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] [2024-11-07 19:20:16,946 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 (17)] Ended with exit code 0 [2024-11-07 19:20:17,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:17,141 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:17,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:17,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1556767, now seen corresponding path program 12 times [2024-11-07 19:20:17,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:17,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1147553273] [2024-11-07 19:20:17,141 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-07 19:20:17,142 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:20:17,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:17,143 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:20:17,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-07 19:20:17,230 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-07 19:20:17,231 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-07 19:20:17,231 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:20:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:20:17,330 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-07 19:20:17,330 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:20:17,331 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-07 19:20:17,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-07 19:20:17,333 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-07 19:20:17,333 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-07 19:20:17,333 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-07 19:20:17,333 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-07 19:20:17,333 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-07 19:20:17,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-11-07 19:20:17,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:17,534 INFO L407 BasicCegarLoop]: Path program histogram: [12, 1, 1, 1, 1, 1] [2024-11-07 19:20:17,602 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 19:20:17,602 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 19:20:17,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:20:17 BasicIcfg [2024-11-07 19:20:17,607 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 19:20:17,607 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 19:20:17,607 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 19:20:17,607 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 19:20:17,608 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:19:59" (3/4) ... [2024-11-07 19:20:17,612 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 19:20:17,613 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 19:20:17,613 INFO L158 Benchmark]: Toolchain (without parser) took 19438.90ms. Allocated memory was 117.4MB in the beginning and 595.6MB in the end (delta: 478.2MB). Free memory was 92.0MB in the beginning and 429.7MB in the end (delta: -337.7MB). Peak memory consumption was 141.0MB. Max. memory is 16.1GB. [2024-11-07 19:20:17,614 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 83.9MB. Free memory is still 51.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:20:17,614 INFO L158 Benchmark]: CACSL2BoogieTranslator took 628.77ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 66.4MB in the end (delta: 25.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 19:20:17,614 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.11ms. Allocated memory is still 117.4MB. Free memory was 66.4MB in the beginning and 63.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:20:17,616 INFO L158 Benchmark]: Boogie Preprocessor took 68.38ms. Allocated memory is still 117.4MB. Free memory was 63.9MB in the beginning and 60.0MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 19:20:17,616 INFO L158 Benchmark]: RCFGBuilder took 866.07ms. Allocated memory is still 117.4MB. Free memory was 60.0MB in the beginning and 69.1MB in the end (delta: -9.1MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. [2024-11-07 19:20:17,616 INFO L158 Benchmark]: TraceAbstraction took 17801.02ms. Allocated memory was 117.4MB in the beginning and 595.6MB in the end (delta: 478.2MB). Free memory was 68.3MB in the beginning and 429.9MB in the end (delta: -361.5MB). Peak memory consumption was 116.4MB. Max. memory is 16.1GB. [2024-11-07 19:20:17,616 INFO L158 Benchmark]: Witness Printer took 5.62ms. Allocated memory is still 595.6MB. Free memory was 429.9MB in the beginning and 429.7MB in the end (delta: 134.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:20:17,617 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.29ms. Allocated memory is still 83.9MB. Free memory is still 51.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 628.77ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 66.4MB in the end (delta: 25.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.11ms. Allocated memory is still 117.4MB. Free memory was 66.4MB in the beginning and 63.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 68.38ms. Allocated memory is still 117.4MB. Free memory was 63.9MB in the beginning and 60.0MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 866.07ms. Allocated memory is still 117.4MB. Free memory was 60.0MB in the beginning and 69.1MB in the end (delta: -9.1MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. * TraceAbstraction took 17801.02ms. Allocated memory was 117.4MB in the beginning and 595.6MB in the end (delta: 478.2MB). Free memory was 68.3MB in the beginning and 429.9MB in the end (delta: -361.5MB). Peak memory consumption was 116.4MB. Max. memory is 16.1GB. * Witness Printer took 5.62ms. Allocated memory is still 595.6MB. Free memory was 429.9MB in the beginning and 429.7MB in the end (delta: 134.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$r_buff1_thd3; [L733] 0 _Bool y$read_delayed; [L734] 0 int *y$read_delayed_var; [L735] 0 int y$w_buff0; [L736] 0 _Bool y$w_buff0_used; [L737] 0 int y$w_buff1; [L738] 0 _Bool y$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2321; [L855] FCALL, FORK 0 pthread_create(&t2321, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2321=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L856] 0 pthread_t t2322; [L857] FCALL, FORK 0 pthread_create(&t2322, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2321=0, t2322=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L858] 0 pthread_t t2323; [L859] FCALL, FORK 0 pthread_create(&t2323, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2321=0, t2322=1, t2323=2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L796] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L813] 3 __unbuffered_p2_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L821] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L822] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L823] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L824] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L826] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 __unbuffered_p2_EBX = y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L832] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L744] 1 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L747] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L770] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321=0, t2322=1, t2323=2, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321=0, t2322=1, t2323=2, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321=0, t2322=1, t2323=2, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L18] 0 __assert_fail ("0", "safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 855]: 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: 859]: 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: 857]: 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 7 procedures, 70 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.6s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 809 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 769 mSDsluCounter, 433 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 420 mSDsCounter, 169 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3829 IncrementalHoareTripleChecker+Invalid, 3998 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 169 mSolverCounterUnsat, 13 mSDtfsCounter, 3829 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 477 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=342occurred in iteration=10, InterpolantAutomatonStates: 120, 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.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 469 NumberOfCodeBlocks, 467 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 422 ConstructedInterpolants, 0 QuantifiedInterpolants, 2873 SizeOfPredicates, 50 NumberOfNonLiveVariables, 2262 ConjunctsInSsa, 206 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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:20:17,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample