./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.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', '0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8'] 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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.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 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:15:39,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:15:39,126 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:15:39,131 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:15:39,132 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:15:39,161 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:15:39,162 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:15:39,162 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:15:39,162 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:15:39,163 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:15:39,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:15:39,163 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:15:39,163 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:15:39,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:15:39,164 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:15:39,165 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:15:39,165 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:15:39,165 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:15:39,165 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:15:39,165 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:15:39,165 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 19:15:39,165 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 19:15:39,165 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 19:15:39,165 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:15:39,165 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:15:39,165 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:15:39,165 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:15:39,165 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:15:39,165 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:15:39,165 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:15:39,165 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:15:39,165 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:15:39,166 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:15:39,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:15:39,166 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:15:39,166 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:15:39,166 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 19:15:39,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 19:15:39,166 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:15:39,166 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:15:39,166 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:15:39,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:15:39,167 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 -> 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 [2024-11-07 19:15:39,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:15:39,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:15:39,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:15:39,465 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:15:39,465 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:15:39,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-11-07 19:15:40,698 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:15:40,991 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:15:40,993 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-11-07 19:15:41,009 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/07a971e29/5f0a253aa4924b629b8f1634a1376955/FLAG87a5ceba0 [2024-11-07 19:15:41,021 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/07a971e29/5f0a253aa4924b629b8f1634a1376955 [2024-11-07 19:15:41,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:15:41,024 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:15:41,026 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:15:41,026 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:15:41,030 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:15:41,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:15:41" (1/1) ... [2024-11-07 19:15:41,033 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@346d302c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:15:41, skipping insertion in model container [2024-11-07 19:15:41,033 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:15:41" (1/1) ... [2024-11-07 19:15:41,071 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:15:41,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:15:41,473 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:15:41,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:15:41,591 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:15:41,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:15:41 WrapperNode [2024-11-07 19:15:41,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:15:41,593 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:15:41,593 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:15:41,593 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:15:41,597 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:15:41" (1/1) ... [2024-11-07 19:15:41,613 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:15:41" (1/1) ... [2024-11-07 19:15:41,640 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-11-07 19:15:41,640 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:15:41,641 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:15:41,641 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:15:41,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:15:41,648 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:15:41" (1/1) ... [2024-11-07 19:15:41,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:15:41" (1/1) ... [2024-11-07 19:15:41,651 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:15:41" (1/1) ... [2024-11-07 19:15:41,670 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:15:41,670 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:15:41" (1/1) ... [2024-11-07 19:15:41,670 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:15:41" (1/1) ... [2024-11-07 19:15:41,676 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:15:41" (1/1) ... [2024-11-07 19:15:41,681 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:15:41" (1/1) ... [2024-11-07 19:15:41,682 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:15:41" (1/1) ... [2024-11-07 19:15:41,683 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:15:41" (1/1) ... [2024-11-07 19:15:41,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:15:41,686 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:15:41,686 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:15:41,686 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:15:41,687 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:15:41" (1/1) ... [2024-11-07 19:15:41,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:15:41,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:15:41,726 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:15:41,729 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:15:41,747 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-07 19:15:41,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:15:41,748 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-07 19:15:41,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-07 19:15:41,748 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-07 19:15:41,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-07 19:15:41,748 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-07 19:15:41,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-07 19:15:41,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 19:15:41,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-07 19:15:41,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:15:41,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:15:41,749 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:15:41,860 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:15:41,862 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:15:42,173 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 19:15:42,173 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:15:42,388 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:15:42,388 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 19:15:42,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:15:42 BoogieIcfgContainer [2024-11-07 19:15:42,390 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:15:42,392 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:15:42,392 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:15:42,397 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:15:42,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:15:41" (1/3) ... [2024-11-07 19:15:42,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fe040ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:15:42, skipping insertion in model container [2024-11-07 19:15:42,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:15:41" (2/3) ... [2024-11-07 19:15:42,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fe040ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:15:42, skipping insertion in model container [2024-11-07 19:15:42,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:15:42" (3/3) ... [2024-11-07 19:15:42,400 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-11-07 19:15:42,411 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:15:42,411 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-07 19:15:42,412 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 19:15:42,485 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 19:15:42,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-11-07 19:15:42,550 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-11-07 19:15:42,552 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:15:42,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 76 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2024-11-07 19:15:42,557 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-11-07 19:15:42,560 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-11-07 19:15:42,568 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:15:42,583 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;@685cd4c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:15:42,585 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-07 19:15:42,593 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:15:42,594 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2024-11-07 19:15:42,594 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:15:42,596 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:15:42,596 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:15:42,597 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:15:42,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:15:42,600 INFO L85 PathProgramCache]: Analyzing trace with hash -655888620, now seen corresponding path program 1 times [2024-11-07 19:15:42,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:15:42,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438335781] [2024-11-07 19:15:42,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:15:42,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:15:42,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:15:43,106 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:15:43,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:15:43,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438335781] [2024-11-07 19:15:43,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438335781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:15:43,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:15:43,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:15:43,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324427370] [2024-11-07 19:15:43,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:15:43,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:15:43,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:15:43,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:15:43,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:15:43,133 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 44 [2024-11-07 19:15:43,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:15:43,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:15:43,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 44 [2024-11-07 19:15:43,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:15:43,475 INFO L124 PetriNetUnfolderBase]: 407/797 cut-off events. [2024-11-07 19:15:43,476 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:15:43,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1460 conditions, 797 events. 407/797 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5335 event pairs, 74 based on Foata normal form. 48/832 useless extension candidates. Maximal degree in co-relation 1449. Up to 496 conditions per place. [2024-11-07 19:15:43,486 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 27 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2024-11-07 19:15:43,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 48 transitions, 167 flow [2024-11-07 19:15:43,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:15:43,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:15:43,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-11-07 19:15:43,501 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2024-11-07 19:15:43,502 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 96 transitions. [2024-11-07 19:15:43,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 48 transitions, 167 flow [2024-11-07 19:15:43,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 48 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 19:15:43,512 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-11-07 19:15:43,515 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, 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=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-11-07 19:15:43,518 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-11-07 19:15:43,519 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-11-07 19:15:43,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:15:43,520 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:15:43,520 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:15:43,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 19:15:43,520 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:15:43,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:15:43,521 INFO L85 PathProgramCache]: Analyzing trace with hash 560481029, now seen corresponding path program 1 times [2024-11-07 19:15:43,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:15:43,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5802492] [2024-11-07 19:15:43,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:15:43,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:15:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:15:43,623 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:15:43,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:15:43,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5802492] [2024-11-07 19:15:43,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5802492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:15:43,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:15:43,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:15:43,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604412417] [2024-11-07 19:15:43,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:15:43,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:15:43,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:15:43,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:15:43,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:15:43,627 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2024-11-07 19:15:43,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:15:43,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:15:43,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2024-11-07 19:15:43,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:15:43,789 INFO L124 PetriNetUnfolderBase]: 361/697 cut-off events. [2024-11-07 19:15:43,789 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-07 19:15:43,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 697 events. 361/697 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4744 event pairs, 361 based on Foata normal form. 24/696 useless extension candidates. Maximal degree in co-relation 1327. Up to 570 conditions per place. [2024-11-07 19:15:43,798 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 17 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-11-07 19:15:43,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 118 flow [2024-11-07 19:15:43,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:15:43,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:15:43,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2024-11-07 19:15:43,800 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-11-07 19:15:43,800 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 77 transitions. [2024-11-07 19:15:43,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 118 flow [2024-11-07 19:15:43,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:15:43,801 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2024-11-07 19:15:43,802 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2024-11-07 19:15:43,804 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2024-11-07 19:15:43,804 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2024-11-07 19:15:43,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:15:43,805 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:15:43,805 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:15:43,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 19:15:43,805 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:15:43,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:15:43,807 INFO L85 PathProgramCache]: Analyzing trace with hash 560482423, now seen corresponding path program 1 times [2024-11-07 19:15:43,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:15:43,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239520099] [2024-11-07 19:15:43,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:15:43,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:15:43,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:15:44,160 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:15:44,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:15:44,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239520099] [2024-11-07 19:15:44,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239520099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:15:44,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:15:44,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:15:44,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060523058] [2024-11-07 19:15:44,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:15:44,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:15:44,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:15:44,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:15:44,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:15:44,173 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-07 19:15:44,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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:15:44,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:15:44,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-07 19:15:44,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:15:44,628 INFO L124 PetriNetUnfolderBase]: 1047/1956 cut-off events. [2024-11-07 19:15:44,628 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:15:44,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3582 conditions, 1956 events. 1047/1956 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 12986 event pairs, 255 based on Foata normal form. 0/1885 useless extension candidates. Maximal degree in co-relation 3576. Up to 1012 conditions per place. [2024-11-07 19:15:44,640 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 29 selfloop transitions, 3 changer transitions 40/85 dead transitions. [2024-11-07 19:15:44,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 85 transitions, 326 flow [2024-11-07 19:15:44,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 19:15:44,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 19:15:44,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2024-11-07 19:15:44,642 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5965909090909091 [2024-11-07 19:15:44,643 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 8 states and 210 transitions. [2024-11-07 19:15:44,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 85 transitions, 326 flow [2024-11-07 19:15:44,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 85 transitions, 325 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:15:44,646 INFO L231 Difference]: Finished difference. Result has 54 places, 35 transitions, 108 flow [2024-11-07 19:15:44,647 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=108, PETRI_PLACES=54, PETRI_TRANSITIONS=35} [2024-11-07 19:15:44,648 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2024-11-07 19:15:44,649 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 35 transitions, 108 flow [2024-11-07 19:15:44,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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:15:44,649 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:15:44,649 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:15:44,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 19:15:44,650 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:15:44,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:15:44,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1020262390, now seen corresponding path program 1 times [2024-11-07 19:15:44,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:15:44,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974048455] [2024-11-07 19:15:44,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:15:44,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:15:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:15:45,481 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:15:45,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:15:45,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974048455] [2024-11-07 19:15:45,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974048455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:15:45,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:15:45,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:15:45,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345880662] [2024-11-07 19:15:45,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:15:45,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 19:15:45,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:15:45,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 19:15:45,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:15:45,504 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-07 19:15:45,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 35 transitions, 108 flow. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:15:45,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:15:45,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-07 19:15:45,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:15:46,416 INFO L124 PetriNetUnfolderBase]: 2043/3634 cut-off events. [2024-11-07 19:15:46,417 INFO L125 PetriNetUnfolderBase]: For 2302/2302 co-relation queries the response was YES. [2024-11-07 19:15:46,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8614 conditions, 3634 events. 2043/3634 cut-off events. For 2302/2302 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 25604 event pairs, 275 based on Foata normal form. 113/3740 useless extension candidates. Maximal degree in co-relation 8602. Up to 1617 conditions per place. [2024-11-07 19:15:46,442 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 43 selfloop transitions, 12 changer transitions 55/121 dead transitions. [2024-11-07 19:15:46,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 121 transitions, 636 flow [2024-11-07 19:15:46,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 19:15:46,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-07 19:15:46,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 257 transitions. [2024-11-07 19:15:46,446 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5840909090909091 [2024-11-07 19:15:46,446 INFO L175 Difference]: Start difference. First operand has 54 places, 35 transitions, 108 flow. Second operand 10 states and 257 transitions. [2024-11-07 19:15:46,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 121 transitions, 636 flow [2024-11-07 19:15:46,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 121 transitions, 615 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-11-07 19:15:46,474 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 247 flow [2024-11-07 19:15:46,474 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=247, PETRI_PLACES=63, PETRI_TRANSITIONS=46} [2024-11-07 19:15:46,475 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2024-11-07 19:15:46,475 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 247 flow [2024-11-07 19:15:46,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:15:46,476 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:15:46,476 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:15:46,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 19:15:46,476 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:15:46,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:15:46,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1934505525, now seen corresponding path program 1 times [2024-11-07 19:15:46,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:15:46,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267625683] [2024-11-07 19:15:46,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:15:46,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:15:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:15:47,027 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:15:47,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:15:47,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267625683] [2024-11-07 19:15:47,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267625683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:15:47,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:15:47,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:15:47,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83593215] [2024-11-07 19:15:47,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:15:47,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 19:15:47,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:15:47,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 19:15:47,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:15:47,032 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-11-07 19:15:47,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 46 transitions, 247 flow. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:15:47,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:15:47,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-11-07 19:15:47,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:15:47,710 INFO L124 PetriNetUnfolderBase]: 1445/2807 cut-off events. [2024-11-07 19:15:47,710 INFO L125 PetriNetUnfolderBase]: For 6760/6781 co-relation queries the response was YES. [2024-11-07 19:15:47,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9351 conditions, 2807 events. 1445/2807 cut-off events. For 6760/6781 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 20580 event pairs, 360 based on Foata normal form. 78/2789 useless extension candidates. Maximal degree in co-relation 9331. Up to 1475 conditions per place. [2024-11-07 19:15:47,734 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 29 selfloop transitions, 4 changer transitions 29/83 dead transitions. [2024-11-07 19:15:47,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 83 transitions, 555 flow [2024-11-07 19:15:47,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 19:15:47,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-07 19:15:47,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2024-11-07 19:15:47,736 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-11-07 19:15:47,736 INFO L175 Difference]: Start difference. First operand has 63 places, 46 transitions, 247 flow. Second operand 7 states and 175 transitions. [2024-11-07 19:15:47,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 83 transitions, 555 flow [2024-11-07 19:15:47,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 83 transitions, 543 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-11-07 19:15:47,753 INFO L231 Difference]: Finished difference. Result has 66 places, 46 transitions, 261 flow [2024-11-07 19:15:47,753 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=261, PETRI_PLACES=66, PETRI_TRANSITIONS=46} [2024-11-07 19:15:47,755 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places. [2024-11-07 19:15:47,755 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 46 transitions, 261 flow [2024-11-07 19:15:47,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:15:47,756 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:15:47,756 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:15:47,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 19:15:47,756 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:15:47,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:15:47,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1084705576, now seen corresponding path program 1 times [2024-11-07 19:15:47,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:15:47,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213977547] [2024-11-07 19:15:47,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:15:47,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:15:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:15:47,932 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:15:47,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:15:47,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213977547] [2024-11-07 19:15:47,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213977547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:15:47,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:15:47,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:15:47,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254854058] [2024-11-07 19:15:47,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:15:47,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:15:47,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:15:47,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:15:47,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:15:47,947 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-11-07 19:15:47,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 46 transitions, 261 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:15:47,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:15:47,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-11-07 19:15:47,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:15:48,484 INFO L124 PetriNetUnfolderBase]: 2747/4642 cut-off events. [2024-11-07 19:15:48,484 INFO L125 PetriNetUnfolderBase]: For 8356/8657 co-relation queries the response was YES. [2024-11-07 19:15:48,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14169 conditions, 4642 events. 2747/4642 cut-off events. For 8356/8657 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 30640 event pairs, 444 based on Foata normal form. 205/4677 useless extension candidates. Maximal degree in co-relation 14144. Up to 2523 conditions per place. [2024-11-07 19:15:48,525 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 51 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2024-11-07 19:15:48,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 75 transitions, 513 flow [2024-11-07 19:15:48,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:15:48,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:15:48,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-11-07 19:15:48,526 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6193181818181818 [2024-11-07 19:15:48,526 INFO L175 Difference]: Start difference. First operand has 66 places, 46 transitions, 261 flow. Second operand 4 states and 109 transitions. [2024-11-07 19:15:48,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 75 transitions, 513 flow [2024-11-07 19:15:48,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 75 transitions, 485 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-11-07 19:15:48,544 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 283 flow [2024-11-07 19:15:48,544 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=283, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2024-11-07 19:15:48,545 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2024-11-07 19:15:48,546 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 283 flow [2024-11-07 19:15:48,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:15:48,546 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:15:48,547 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:15:48,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 19:15:48,547 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:15:48,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:15:48,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1960827456, now seen corresponding path program 1 times [2024-11-07 19:15:48,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:15:48,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643546987] [2024-11-07 19:15:48,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:15:48,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:15:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:15:48,738 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:15:48,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:15:48,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643546987] [2024-11-07 19:15:48,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643546987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:15:48,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:15:48,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:15:48,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779325138] [2024-11-07 19:15:48,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:15:48,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:15:48,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:15:48,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:15:48,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:15:48,746 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-07 19:15:48,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 283 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:15:48,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:15:48,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-07 19:15:48,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:15:49,620 INFO L124 PetriNetUnfolderBase]: 2768/5123 cut-off events. [2024-11-07 19:15:49,621 INFO L125 PetriNetUnfolderBase]: For 9376/9573 co-relation queries the response was YES. [2024-11-07 19:15:49,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16879 conditions, 5123 events. 2768/5123 cut-off events. For 9376/9573 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 38652 event pairs, 900 based on Foata normal form. 151/4940 useless extension candidates. Maximal degree in co-relation 16856. Up to 1814 conditions per place. [2024-11-07 19:15:49,658 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 47 selfloop transitions, 10 changer transitions 18/94 dead transitions. [2024-11-07 19:15:49,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 94 transitions, 668 flow [2024-11-07 19:15:49,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 19:15:49,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-07 19:15:49,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 182 transitions. [2024-11-07 19:15:49,659 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2024-11-07 19:15:49,659 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 283 flow. Second operand 7 states and 182 transitions. [2024-11-07 19:15:49,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 94 transitions, 668 flow [2024-11-07 19:15:49,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 94 transitions, 658 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-07 19:15:49,666 INFO L231 Difference]: Finished difference. Result has 71 places, 54 transitions, 362 flow [2024-11-07 19:15:49,666 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=362, PETRI_PLACES=71, PETRI_TRANSITIONS=54} [2024-11-07 19:15:49,667 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 22 predicate places. [2024-11-07 19:15:49,667 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 54 transitions, 362 flow [2024-11-07 19:15:49,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:15:49,667 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:15:49,667 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:15:49,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 19:15:49,668 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:15:49,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:15:49,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1523089990, now seen corresponding path program 1 times [2024-11-07 19:15:49,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:15:49,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929914125] [2024-11-07 19:15:49,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:15:49,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:15:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:15:50,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:15:50,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:15:50,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929914125] [2024-11-07 19:15:50,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929914125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:15:50,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:15:50,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 19:15:50,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290302710] [2024-11-07 19:15:50,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:15:50,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 19:15:50,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:15:50,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 19:15:50,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 19:15:50,441 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-11-07 19:15:50,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 54 transitions, 362 flow. Second operand has 9 states, 9 states have (on average 19.666666666666668) internal successors, (177), 9 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:15:50,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:15:50,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-11-07 19:15:50,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:15:51,341 INFO L124 PetriNetUnfolderBase]: 3143/5863 cut-off events. [2024-11-07 19:15:51,342 INFO L125 PetriNetUnfolderBase]: For 15744/16010 co-relation queries the response was YES. [2024-11-07 19:15:51,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20534 conditions, 5863 events. 3143/5863 cut-off events. For 15744/16010 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 45925 event pairs, 1024 based on Foata normal form. 146/5677 useless extension candidates. Maximal degree in co-relation 20506. Up to 3253 conditions per place. [2024-11-07 19:15:51,391 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 47 selfloop transitions, 14 changer transitions 17/104 dead transitions. [2024-11-07 19:15:51,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 104 transitions, 794 flow [2024-11-07 19:15:51,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 19:15:51,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 19:15:51,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 225 transitions. [2024-11-07 19:15:51,393 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-11-07 19:15:51,394 INFO L175 Difference]: Start difference. First operand has 71 places, 54 transitions, 362 flow. Second operand 9 states and 225 transitions. [2024-11-07 19:15:51,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 104 transitions, 794 flow [2024-11-07 19:15:51,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 104 transitions, 765 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-11-07 19:15:51,427 INFO L231 Difference]: Finished difference. Result has 83 places, 63 transitions, 493 flow [2024-11-07 19:15:51,427 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=493, PETRI_PLACES=83, PETRI_TRANSITIONS=63} [2024-11-07 19:15:51,428 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 34 predicate places. [2024-11-07 19:15:51,428 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 63 transitions, 493 flow [2024-11-07 19:15:51,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.666666666666668) internal successors, (177), 9 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:15:51,428 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:15:51,429 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:15:51,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 19:15:51,429 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:15:51,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:15:51,429 INFO L85 PathProgramCache]: Analyzing trace with hash 999921068, now seen corresponding path program 2 times [2024-11-07 19:15:51,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:15:51,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21920098] [2024-11-07 19:15:51,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:15:51,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:15:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:15:51,612 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:15:51,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:15:51,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21920098] [2024-11-07 19:15:51,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21920098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:15:51,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:15:51,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:15:51,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342948094] [2024-11-07 19:15:51,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:15:51,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:15:51,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:15:51,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:15:51,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:15:51,621 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-11-07 19:15:51,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 63 transitions, 493 flow. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:15:51,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:15:51,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-11-07 19:15:51,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:15:52,328 INFO L124 PetriNetUnfolderBase]: 3176/5214 cut-off events. [2024-11-07 19:15:52,328 INFO L125 PetriNetUnfolderBase]: For 18781/19828 co-relation queries the response was YES. [2024-11-07 19:15:52,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19524 conditions, 5214 events. 3176/5214 cut-off events. For 18781/19828 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 33739 event pairs, 247 based on Foata normal form. 362/5343 useless extension candidates. Maximal degree in co-relation 19490. Up to 1893 conditions per place. [2024-11-07 19:15:52,363 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 63 selfloop transitions, 8 changer transitions 22/111 dead transitions. [2024-11-07 19:15:52,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 111 transitions, 1012 flow [2024-11-07 19:15:52,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:15:52,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:15:52,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2024-11-07 19:15:52,365 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6272727272727273 [2024-11-07 19:15:52,365 INFO L175 Difference]: Start difference. First operand has 83 places, 63 transitions, 493 flow. Second operand 5 states and 138 transitions. [2024-11-07 19:15:52,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 111 transitions, 1012 flow [2024-11-07 19:15:52,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 111 transitions, 970 flow, removed 18 selfloop flow, removed 2 redundant places. [2024-11-07 19:15:52,397 INFO L231 Difference]: Finished difference. Result has 87 places, 55 transitions, 386 flow [2024-11-07 19:15:52,397 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=386, PETRI_PLACES=87, PETRI_TRANSITIONS=55} [2024-11-07 19:15:52,398 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 38 predicate places. [2024-11-07 19:15:52,398 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 55 transitions, 386 flow [2024-11-07 19:15:52,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:15:52,399 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:15:52,399 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:15:52,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 19:15:52,399 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:15:52,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:15:52,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1178824607, now seen corresponding path program 1 times [2024-11-07 19:15:52,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:15:52,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916396954] [2024-11-07 19:15:52,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:15:52,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:15:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:15:52,640 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:15:52,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:15:52,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916396954] [2024-11-07 19:15:52,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916396954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:15:52,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:15:52,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:15:52,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102140619] [2024-11-07 19:15:52,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:15:52,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:15:52,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:15:52,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:15:52,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:15:52,645 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-11-07 19:15:52,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 55 transitions, 386 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:15:52,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:15:52,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-11-07 19:15:52,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:15:53,022 INFO L124 PetriNetUnfolderBase]: 2192/3650 cut-off events. [2024-11-07 19:15:53,023 INFO L125 PetriNetUnfolderBase]: For 15253/16678 co-relation queries the response was YES. [2024-11-07 19:15:53,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14718 conditions, 3650 events. 2192/3650 cut-off events. For 15253/16678 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 23871 event pairs, 197 based on Foata normal form. 265/3714 useless extension candidates. Maximal degree in co-relation 14682. Up to 1616 conditions per place. [2024-11-07 19:15:53,047 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 57 selfloop transitions, 11 changer transitions 6/90 dead transitions. [2024-11-07 19:15:53,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 90 transitions, 740 flow [2024-11-07 19:15:53,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:15:53,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:15:53,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2024-11-07 19:15:53,049 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5795454545454546 [2024-11-07 19:15:53,049 INFO L175 Difference]: Start difference. First operand has 87 places, 55 transitions, 386 flow. Second operand 6 states and 153 transitions. [2024-11-07 19:15:53,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 90 transitions, 740 flow [2024-11-07 19:15:53,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 90 transitions, 662 flow, removed 31 selfloop flow, removed 13 redundant places. [2024-11-07 19:15:53,066 INFO L231 Difference]: Finished difference. Result has 73 places, 53 transitions, 342 flow [2024-11-07 19:15:53,066 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=342, PETRI_PLACES=73, PETRI_TRANSITIONS=53} [2024-11-07 19:15:53,067 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 24 predicate places. [2024-11-07 19:15:53,067 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 53 transitions, 342 flow [2024-11-07 19:15:53,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:15:53,067 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:15:53,067 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:15:53,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 19:15:53,068 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:15:53,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:15:53,068 INFO L85 PathProgramCache]: Analyzing trace with hash 826938328, now seen corresponding path program 1 times [2024-11-07 19:15:53,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:15:53,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307802616] [2024-11-07 19:15:53,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:15:53,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:15:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:15:53,293 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:15:53,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:15:53,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307802616] [2024-11-07 19:15:53,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307802616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:15:53,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:15:53,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:15:53,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893116647] [2024-11-07 19:15:53,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:15:53,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:15:53,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:15:53,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:15:53,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:15:53,296 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-07 19:15:53,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 53 transitions, 342 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:15:53,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:15:53,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-07 19:15:53,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:15:53,618 INFO L124 PetriNetUnfolderBase]: 916/1930 cut-off events. [2024-11-07 19:15:53,618 INFO L125 PetriNetUnfolderBase]: For 5546/5966 co-relation queries the response was YES. [2024-11-07 19:15:53,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6652 conditions, 1930 events. 916/1930 cut-off events. For 5546/5966 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 13726 event pairs, 242 based on Foata normal form. 56/1804 useless extension candidates. Maximal degree in co-relation 6625. Up to 689 conditions per place. [2024-11-07 19:15:53,631 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 23 selfloop transitions, 1 changer transitions 41/89 dead transitions. [2024-11-07 19:15:53,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 89 transitions, 671 flow [2024-11-07 19:15:53,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:15:53,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:15:53,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2024-11-07 19:15:53,633 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-11-07 19:15:53,633 INFO L175 Difference]: Start difference. First operand has 73 places, 53 transitions, 342 flow. Second operand 6 states and 150 transitions. [2024-11-07 19:15:53,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 89 transitions, 671 flow [2024-11-07 19:15:53,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 89 transitions, 557 flow, removed 47 selfloop flow, removed 8 redundant places. [2024-11-07 19:15:53,650 INFO L231 Difference]: Finished difference. Result has 74 places, 45 transitions, 234 flow [2024-11-07 19:15:53,650 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=234, PETRI_PLACES=74, PETRI_TRANSITIONS=45} [2024-11-07 19:15:53,651 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 25 predicate places. [2024-11-07 19:15:53,651 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 45 transitions, 234 flow [2024-11-07 19:15:53,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:15:53,651 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:15:53,651 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:15:53,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 19:15:53,651 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:15:53,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:15:53,652 INFO L85 PathProgramCache]: Analyzing trace with hash -967141076, now seen corresponding path program 2 times [2024-11-07 19:15:53,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:15:53,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426973689] [2024-11-07 19:15:53,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:15:53,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:15:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:15:54,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:15:54,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:15:54,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426973689] [2024-11-07 19:15:54,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426973689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:15:54,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:15:54,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 19:15:54,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395709572] [2024-11-07 19:15:54,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:15:54,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 19:15:54,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:15:54,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 19:15:54,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 19:15:54,971 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-07 19:15:54,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 45 transitions, 234 flow. Second operand has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:15:54,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:15:54,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-07 19:15:54,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:15:55,561 INFO L124 PetriNetUnfolderBase]: 509/1084 cut-off events. [2024-11-07 19:15:55,561 INFO L125 PetriNetUnfolderBase]: For 1429/1537 co-relation queries the response was YES. [2024-11-07 19:15:55,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3052 conditions, 1084 events. 509/1084 cut-off events. For 1429/1537 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 6582 event pairs, 129 based on Foata normal form. 22/1011 useless extension candidates. Maximal degree in co-relation 3027. Up to 413 conditions per place. [2024-11-07 19:15:55,566 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 22 selfloop transitions, 7 changer transitions 34/83 dead transitions. [2024-11-07 19:15:55,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 83 transitions, 500 flow [2024-11-07 19:15:55,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 19:15:55,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-07 19:15:55,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 227 transitions. [2024-11-07 19:15:55,568 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4690082644628099 [2024-11-07 19:15:55,568 INFO L175 Difference]: Start difference. First operand has 74 places, 45 transitions, 234 flow. Second operand 11 states and 227 transitions. [2024-11-07 19:15:55,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 83 transitions, 500 flow [2024-11-07 19:15:55,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 83 transitions, 463 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-11-07 19:15:55,575 INFO L231 Difference]: Finished difference. Result has 74 places, 42 transitions, 219 flow [2024-11-07 19:15:55,575 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=219, PETRI_PLACES=74, PETRI_TRANSITIONS=42} [2024-11-07 19:15:55,576 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 25 predicate places. [2024-11-07 19:15:55,576 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 42 transitions, 219 flow [2024-11-07 19:15:55,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:15:55,576 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:15:55,577 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:15:55,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 19:15:55,577 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:15:55,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:15:55,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1583802696, now seen corresponding path program 3 times [2024-11-07 19:15:55,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:15:55,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521123052] [2024-11-07 19:15:55,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:15:55,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:15:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:15:55,623 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:15:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:15:55,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 19:15:55,708 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:15:55,708 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-07 19:15:55,711 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-07 19:15:55,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-07 19:15:55,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-07 19:15:55,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-07 19:15:55,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-07 19:15:55,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-07 19:15:55,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 19:15:55,713 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:15:55,790 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 19:15:55,790 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 19:15:55,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:15:55 BasicIcfg [2024-11-07 19:15:55,794 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 19:15:55,794 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 19:15:55,795 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 19:15:55,795 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 19:15:55,795 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:15:42" (3/4) ... [2024-11-07 19:15:55,797 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 19:15:55,797 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 19:15:55,798 INFO L158 Benchmark]: Toolchain (without parser) took 14773.53ms. Allocated memory was 100.7MB in the beginning and 687.9MB in the end (delta: 587.2MB). Free memory was 75.4MB in the beginning and 520.7MB in the end (delta: -445.2MB). Peak memory consumption was 146.9MB. Max. memory is 16.1GB. [2024-11-07 19:15:55,798 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 83.9MB. Free memory is still 47.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:15:55,799 INFO L158 Benchmark]: CACSL2BoogieTranslator took 566.61ms. Allocated memory is still 100.7MB. Free memory was 75.3MB in the beginning and 52.6MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 19:15:55,799 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.67ms. Allocated memory is still 100.7MB. Free memory was 52.6MB in the beginning and 50.1MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:15:55,799 INFO L158 Benchmark]: Boogie Preprocessor took 44.45ms. Allocated memory is still 100.7MB. Free memory was 50.1MB in the beginning and 47.3MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:15:55,799 INFO L158 Benchmark]: RCFGBuilder took 704.42ms. Allocated memory is still 100.7MB. Free memory was 47.3MB in the beginning and 37.4MB in the end (delta: 9.9MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2024-11-07 19:15:55,800 INFO L158 Benchmark]: TraceAbstraction took 13402.06ms. Allocated memory was 100.7MB in the beginning and 687.9MB in the end (delta: 587.2MB). Free memory was 36.9MB in the beginning and 520.7MB in the end (delta: -483.8MB). Peak memory consumption was 100.5MB. Max. memory is 16.1GB. [2024-11-07 19:15:55,800 INFO L158 Benchmark]: Witness Printer took 2.98ms. Allocated memory is still 687.9MB. Free memory was 520.7MB in the beginning and 520.7MB in the end (delta: 61.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 19:15:55,801 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 83.9MB. Free memory is still 47.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 566.61ms. Allocated memory is still 100.7MB. Free memory was 75.3MB in the beginning and 52.6MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.67ms. Allocated memory is still 100.7MB. Free memory was 52.6MB in the beginning and 50.1MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.45ms. Allocated memory is still 100.7MB. Free memory was 50.1MB in the beginning and 47.3MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 704.42ms. Allocated memory is still 100.7MB. Free memory was 47.3MB in the beginning and 37.4MB in the end (delta: 9.9MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * TraceAbstraction took 13402.06ms. Allocated memory was 100.7MB in the beginning and 687.9MB in the end (delta: 587.2MB). Free memory was 36.9MB in the beginning and 520.7MB in the end (delta: -483.8MB). Peak memory consumption was 100.5MB. Max. memory is 16.1GB. * Witness Printer took 2.98ms. Allocated memory is still 687.9MB. Free memory was 520.7MB in the beginning and 520.7MB in the end (delta: 61.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1492; [L814] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1492=-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, z=0] [L815] 0 pthread_t t1493; [L816] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1492=-1, t1493=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, z=0] [L817] 0 pthread_t t1494; [L818] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1492=-1, t1493=0, t1494=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, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L780] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L780] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=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=0, y$r_buff0_thd3=1, 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, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=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=0, y$r_buff0_thd3=1, 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, z=0] [L741] 1 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=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=0, y$r_buff0_thd3=1, 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, z=1] [L744] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=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=0, y$r_buff0_thd3=1, 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, z=1] [L756] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, 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, z=1] [L759] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, 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, z=1] [L762] 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) [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] 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 [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] 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}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, 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, z=1] [L791] 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) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 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 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 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}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, 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=1, 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, z=1] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=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=2, 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=1, 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, z=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, 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, z=1] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, 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, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492=-1, t1493=0, t1494=1, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, 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, z=1] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 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) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 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 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 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_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492=-1, t1493=0, t1494=1, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, 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, z=1] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 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) [L836] 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)) [L837] 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)) [L838] 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)) [L839] 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)) [L840] 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)) [L841] 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)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492=-1, t1493=0, t1494=1, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=1] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=1] [L17] 0 __assert_fail ("0", "mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 818]: 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: 814]: 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, 68 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: 13.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 507 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 479 mSDsluCounter, 226 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 181 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1538 IncrementalHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 45 mSDtfsCounter, 1538 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=493occurred in iteration=8, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 1705 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:15:55,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.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 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:15:58,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:15:58,112 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:15:58,121 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:15:58,122 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:15:58,194 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:15:58,195 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:15:58,195 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:15:58,196 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:15:58,196 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:15:58,196 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:15:58,196 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:15:58,196 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:15:58,196 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:15:58,196 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:15:58,196 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:15:58,197 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:15:58,197 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:15:58,197 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:15:58,197 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:15:58,197 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 19:15:58,197 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 19:15:58,197 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 19:15:58,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:15:58,201 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:15:58,201 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 19:15:58,201 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:15:58,202 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 19:15:58,202 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:15:58,202 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:15:58,202 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:15:58,202 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:15:58,202 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:15:58,202 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:15:58,203 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:15:58,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:15:58,203 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:15:58,203 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:15:58,203 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 19:15:58,203 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 19:15:58,203 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:15:58,203 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:15:58,203 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:15:58,203 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:15:58,204 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 -> 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 [2024-11-07 19:15:58,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:15:58,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:15:58,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:15:58,467 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:15:58,469 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:15:58,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-11-07 19:15:59,794 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:16:00,156 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:16:00,157 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-11-07 19:16:00,175 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9c41c9b2e/c0abfe6b2a4947deb1b2551b4cc48f33/FLAGc48d3ef2c [2024-11-07 19:16:00,195 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9c41c9b2e/c0abfe6b2a4947deb1b2551b4cc48f33 [2024-11-07 19:16:00,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:16:00,202 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:16:00,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:16:00,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:16:00,207 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:16:00,208 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:16:00" (1/1) ... [2024-11-07 19:16:00,210 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ec29b6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:16:00, skipping insertion in model container [2024-11-07 19:16:00,210 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:16:00" (1/1) ... [2024-11-07 19:16:00,240 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:16:00,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:16:00,512 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:16:00,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:16:00,617 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:16:00,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:16:00 WrapperNode [2024-11-07 19:16:00,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:16:00,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:16:00,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:16:00,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:16:00,624 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:16:00" (1/1) ... [2024-11-07 19:16:00,640 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:16:00" (1/1) ... [2024-11-07 19:16:00,669 INFO L138 Inliner]: procedures = 176, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2024-11-07 19:16:00,673 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:16:00,673 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:16:00,673 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:16:00,673 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:16:00,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:16:00" (1/1) ... [2024-11-07 19:16:00,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:16:00" (1/1) ... [2024-11-07 19:16:00,683 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:16:00" (1/1) ... [2024-11-07 19:16:00,700 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:16:00,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:16:00" (1/1) ... [2024-11-07 19:16:00,701 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:16:00" (1/1) ... [2024-11-07 19:16:00,708 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:16:00" (1/1) ... [2024-11-07 19:16:00,709 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:16:00" (1/1) ... [2024-11-07 19:16:00,712 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:16:00" (1/1) ... [2024-11-07 19:16:00,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:16:00" (1/1) ... [2024-11-07 19:16:00,716 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:16:00,716 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:16:00,717 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:16:00,717 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:16:00,718 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:16:00" (1/1) ... [2024-11-07 19:16:00,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:16:00,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:16:00,753 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:16:00,759 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:16:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-07 19:16:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:16:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 19:16:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-07 19:16:00,778 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-07 19:16:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-07 19:16:00,778 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-07 19:16:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-07 19:16:00,778 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-07 19:16:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-07 19:16:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:16:00,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:16:00,780 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:16:00,929 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:16:00,930 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:16:01,234 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 19:16:01,235 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:16:01,409 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:16:01,409 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 19:16:01,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:16:01 BoogieIcfgContainer [2024-11-07 19:16:01,410 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:16:01,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:16:01,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:16:01,416 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:16:01,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:16:00" (1/3) ... [2024-11-07 19:16:01,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279b0a18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:16:01, skipping insertion in model container [2024-11-07 19:16:01,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:16:00" (2/3) ... [2024-11-07 19:16:01,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279b0a18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:16:01, skipping insertion in model container [2024-11-07 19:16:01,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:16:01" (3/3) ... [2024-11-07 19:16:01,420 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-11-07 19:16:01,432 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:16:01,433 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-07 19:16:01,433 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 19:16:01,510 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 19:16:01,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-11-07 19:16:01,575 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-11-07 19:16:01,577 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:16:01,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 76 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2024-11-07 19:16:01,580 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-11-07 19:16:01,582 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-11-07 19:16:01,590 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:16:01,601 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;@423d76b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:16:01,601 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-07 19:16:01,610 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:16:01,611 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2024-11-07 19:16:01,612 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:16:01,612 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:16:01,613 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:16:01,613 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:16:01,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:16:01,618 INFO L85 PathProgramCache]: Analyzing trace with hash 368939028, now seen corresponding path program 1 times [2024-11-07 19:16:01,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:16:01,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279439798] [2024-11-07 19:16:01,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:16:01,629 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:16:01,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:16:01,633 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:16:01,634 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:16:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:16:01,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 19:16:01,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:16:01,792 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:16:01,793 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:16:01,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:16:01,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279439798] [2024-11-07 19:16:01,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1279439798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:16:01,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:16:01,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:16:01,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122404893] [2024-11-07 19:16:01,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:16:01,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:16:01,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:16:01,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:16:01,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:16:01,829 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 44 [2024-11-07 19:16:01,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:16:01,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:16:01,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 44 [2024-11-07 19:16:01,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:16:02,128 INFO L124 PetriNetUnfolderBase]: 407/797 cut-off events. [2024-11-07 19:16:02,128 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:16:02,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1460 conditions, 797 events. 407/797 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5335 event pairs, 74 based on Foata normal form. 48/832 useless extension candidates. Maximal degree in co-relation 1449. Up to 496 conditions per place. [2024-11-07 19:16:02,140 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 27 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2024-11-07 19:16:02,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 48 transitions, 167 flow [2024-11-07 19:16:02,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:16:02,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:16:02,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-11-07 19:16:02,155 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2024-11-07 19:16:02,157 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 96 transitions. [2024-11-07 19:16:02,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 48 transitions, 167 flow [2024-11-07 19:16:02,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 48 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 19:16:02,165 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-11-07 19:16:02,168 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, 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=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-11-07 19:16:02,173 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-11-07 19:16:02,173 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-11-07 19:16:02,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:16:02,174 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:16:02,174 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:16:02,178 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:16:02,377 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:16:02,377 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:16:02,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:16:02,378 INFO L85 PathProgramCache]: Analyzing trace with hash -46216889, now seen corresponding path program 1 times [2024-11-07 19:16:02,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:16:02,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [875783714] [2024-11-07 19:16:02,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:16:02,379 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:16:02,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:16:02,418 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:16:02,419 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:16:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:16:02,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:16:02,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:16:02,554 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:16:02,554 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:16:02,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:16:02,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [875783714] [2024-11-07 19:16:02,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [875783714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:16:02,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:16:02,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:16:02,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339547874] [2024-11-07 19:16:02,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:16:02,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:16:02,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:16:02,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:16:02,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:16:02,570 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-11-07 19:16:02,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:16:02,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:16:02,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-11-07 19:16:02,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:16:02,984 INFO L124 PetriNetUnfolderBase]: 1129/1945 cut-off events. [2024-11-07 19:16:02,984 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2024-11-07 19:16:02,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3805 conditions, 1945 events. 1129/1945 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 12298 event pairs, 94 based on Foata normal form. 60/1996 useless extension candidates. Maximal degree in co-relation 3795. Up to 1184 conditions per place. [2024-11-07 19:16:02,995 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 38 selfloop transitions, 5 changer transitions 1/57 dead transitions. [2024-11-07 19:16:02,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 220 flow [2024-11-07 19:16:02,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:16:02,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:16:02,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2024-11-07 19:16:02,998 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-11-07 19:16:02,999 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 4 states and 110 transitions. [2024-11-07 19:16:02,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 220 flow [2024-11-07 19:16:02,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:16:03,001 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 112 flow [2024-11-07 19:16:03,002 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2024-11-07 19:16:03,003 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2024-11-07 19:16:03,003 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 112 flow [2024-11-07 19:16:03,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:16:03,004 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:16:03,004 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:16:03,008 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:16:03,204 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:16:03,204 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:16:03,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:16:03,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1930264810, now seen corresponding path program 1 times [2024-11-07 19:16:03,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:16:03,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439773637] [2024-11-07 19:16:03,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:16:03,206 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:16:03,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:16:03,208 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:16:03,209 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:16:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:16:03,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 19:16:03,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:16:03,348 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:16:03,349 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:16:03,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:16:03,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [439773637] [2024-11-07 19:16:03,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [439773637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:16:03,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:16:03,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:16:03,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705204263] [2024-11-07 19:16:03,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:16:03,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:16:03,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:16:03,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:16:03,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:16:03,364 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-11-07 19:16:03,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:16:03,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:16:03,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-11-07 19:16:03,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:16:03,619 INFO L124 PetriNetUnfolderBase]: 748/1316 cut-off events. [2024-11-07 19:16:03,621 INFO L125 PetriNetUnfolderBase]: For 333/333 co-relation queries the response was YES. [2024-11-07 19:16:03,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2963 conditions, 1316 events. 748/1316 cut-off events. For 333/333 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7332 event pairs, 34 based on Foata normal form. 54/1361 useless extension candidates. Maximal degree in co-relation 2951. Up to 645 conditions per place. [2024-11-07 19:16:03,630 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 47 selfloop transitions, 8 changer transitions 1/69 dead transitions. [2024-11-07 19:16:03,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 69 transitions, 305 flow [2024-11-07 19:16:03,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:16:03,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:16:03,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2024-11-07 19:16:03,634 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6272727272727273 [2024-11-07 19:16:03,634 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 112 flow. Second operand 5 states and 138 transitions. [2024-11-07 19:16:03,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 69 transitions, 305 flow [2024-11-07 19:16:03,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 69 transitions, 295 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-07 19:16:03,639 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 152 flow [2024-11-07 19:16:03,639 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2024-11-07 19:16:03,640 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2024-11-07 19:16:03,641 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 152 flow [2024-11-07 19:16:03,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:16:03,641 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:16:03,641 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:16:03,645 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:16:03,841 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:16:03,842 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:16:03,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:16:03,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1127643693, now seen corresponding path program 1 times [2024-11-07 19:16:03,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:16:03,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975234042] [2024-11-07 19:16:03,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:16:03,843 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:16:03,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:16:03,845 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:16:03,846 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:16:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:16:03,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 19:16:03,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:16:03,977 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:16:03,977 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:16:03,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:16:03,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975234042] [2024-11-07 19:16:03,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [975234042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:16:03,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:16:03,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:16:03,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987976434] [2024-11-07 19:16:03,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:16:03,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:16:03,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:16:03,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:16:03,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:16:03,986 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-11-07 19:16:03,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:16:03,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:16:03,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-11-07 19:16:03,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:16:04,225 INFO L124 PetriNetUnfolderBase]: 381/663 cut-off events. [2024-11-07 19:16:04,225 INFO L125 PetriNetUnfolderBase]: For 571/571 co-relation queries the response was YES. [2024-11-07 19:16:04,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1741 conditions, 663 events. 381/663 cut-off events. For 571/571 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2869 event pairs, 23 based on Foata normal form. 32/686 useless extension candidates. Maximal degree in co-relation 1727. Up to 228 conditions per place. [2024-11-07 19:16:04,229 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 42 selfloop transitions, 11 changer transitions 1/67 dead transitions. [2024-11-07 19:16:04,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 67 transitions, 320 flow [2024-11-07 19:16:04,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:16:04,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:16:04,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2024-11-07 19:16:04,232 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2024-11-07 19:16:04,233 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 152 flow. Second operand 6 states and 152 transitions. [2024-11-07 19:16:04,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 67 transitions, 320 flow [2024-11-07 19:16:04,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 67 transitions, 295 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-07 19:16:04,239 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 166 flow [2024-11-07 19:16:04,240 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=166, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2024-11-07 19:16:04,241 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2024-11-07 19:16:04,242 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 166 flow [2024-11-07 19:16:04,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:16:04,242 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:16:04,242 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:16:04,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-07 19:16:04,446 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:16:04,446 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:16:04,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:16:04,446 INFO L85 PathProgramCache]: Analyzing trace with hash 307696606, now seen corresponding path program 1 times [2024-11-07 19:16:04,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:16:04,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709820853] [2024-11-07 19:16:04,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:16:04,447 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:16:04,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:16:04,450 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:16:04,451 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:16:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:16:04,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 19:16:04,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:16:04,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:16:04,595 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:16:04,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:16:04,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709820853] [2024-11-07 19:16:04,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709820853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:16:04,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:16:04,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:16:04,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925916025] [2024-11-07 19:16:04,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:16:04,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:16:04,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:16:04,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:16:04,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:16:04,596 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2024-11-07 19:16:04,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:16:04,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:16:04,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2024-11-07 19:16:04,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:16:04,669 INFO L124 PetriNetUnfolderBase]: 186/390 cut-off events. [2024-11-07 19:16:04,670 INFO L125 PetriNetUnfolderBase]: For 131/136 co-relation queries the response was YES. [2024-11-07 19:16:04,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 390 events. 186/390 cut-off events. For 131/136 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1769 event pairs, 178 based on Foata normal form. 8/359 useless extension candidates. Maximal degree in co-relation 839. Up to 311 conditions per place. [2024-11-07 19:16:04,672 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 17 selfloop transitions, 1 changer transitions 1/41 dead transitions. [2024-11-07 19:16:04,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 41 transitions, 202 flow [2024-11-07 19:16:04,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:16:04,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:16:04,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2024-11-07 19:16:04,674 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-11-07 19:16:04,674 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 166 flow. Second operand 3 states and 77 transitions. [2024-11-07 19:16:04,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 41 transitions, 202 flow [2024-11-07 19:16:04,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 41 transitions, 146 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-11-07 19:16:04,676 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 108 flow [2024-11-07 19:16:04,676 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2024-11-07 19:16:04,677 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2024-11-07 19:16:04,677 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 108 flow [2024-11-07 19:16:04,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:16:04,677 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:16:04,677 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:16:04,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-07 19:16:04,878 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:16:04,878 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:16:04,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:16:04,879 INFO L85 PathProgramCache]: Analyzing trace with hash 307698000, now seen corresponding path program 1 times [2024-11-07 19:16:04,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:16:04,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756459526] [2024-11-07 19:16:04,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:16:04,880 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:16:04,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:16:04,882 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:16:04,885 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:16:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:16:04,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 19:16:04,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:16:05,059 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:16:05,061 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:16:05,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:16:05,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756459526] [2024-11-07 19:16:05,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756459526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:16:05,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:16:05,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:16:05,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642145993] [2024-11-07 19:16:05,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:16:05,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:16:05,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:16:05,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:16:05,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:16:05,068 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-11-07 19:16:05,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:16:05,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:16:05,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-11-07 19:16:05,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:16:05,261 INFO L124 PetriNetUnfolderBase]: 488/977 cut-off events. [2024-11-07 19:16:05,262 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:16:05,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1891 conditions, 977 events. 488/977 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5329 event pairs, 215 based on Foata normal form. 8/914 useless extension candidates. Maximal degree in co-relation 1884. Up to 391 conditions per place. [2024-11-07 19:16:05,268 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 27 selfloop transitions, 2 changer transitions 13/62 dead transitions. [2024-11-07 19:16:05,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 62 transitions, 240 flow [2024-11-07 19:16:05,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:16:05,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:16:05,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2024-11-07 19:16:05,270 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6045454545454545 [2024-11-07 19:16:05,270 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 108 flow. Second operand 5 states and 133 transitions. [2024-11-07 19:16:05,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 62 transitions, 240 flow [2024-11-07 19:16:05,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 62 transitions, 239 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:16:05,288 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 119 flow [2024-11-07 19:16:05,288 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2024-11-07 19:16:05,291 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2024-11-07 19:16:05,291 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 119 flow [2024-11-07 19:16:05,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:16:05,291 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:16:05,291 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:16:05,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-07 19:16:05,491 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:16:05,492 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:16:05,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:16:05,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1939789950, now seen corresponding path program 2 times [2024-11-07 19:16:05,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:16:05,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1771999204] [2024-11-07 19:16:05,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 19:16:05,494 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:16:05,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:16:05,496 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:16:05,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-07 19:16:05,583 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 19:16:05,583 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:16:05,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 19:16:05,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:16:05,670 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:16:05,671 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:16:05,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:16:05,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1771999204] [2024-11-07 19:16:05,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1771999204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:16:05,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:16:05,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:16:05,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024688593] [2024-11-07 19:16:05,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:16:05,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:16:05,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:16:05,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:16:05,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:16:05,682 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-11-07 19:16:05,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 119 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:16:05,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:16:05,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-11-07 19:16:05,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:16:05,901 INFO L124 PetriNetUnfolderBase]: 360/766 cut-off events. [2024-11-07 19:16:05,901 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-07 19:16:05,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1549 conditions, 766 events. 360/766 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3867 event pairs, 110 based on Foata normal form. 8/747 useless extension candidates. Maximal degree in co-relation 1539. Up to 326 conditions per place. [2024-11-07 19:16:05,906 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 22 selfloop transitions, 1 changer transitions 22/65 dead transitions. [2024-11-07 19:16:05,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 65 transitions, 267 flow [2024-11-07 19:16:05,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:16:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:16:05,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2024-11-07 19:16:05,908 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-11-07 19:16:05,908 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 119 flow. Second operand 6 states and 154 transitions. [2024-11-07 19:16:05,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 65 transitions, 267 flow [2024-11-07 19:16:05,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 65 transitions, 253 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-07 19:16:05,911 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 120 flow [2024-11-07 19:16:05,911 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=120, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2024-11-07 19:16:05,912 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2024-11-07 19:16:05,912 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 120 flow [2024-11-07 19:16:05,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:16:05,912 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:16:05,913 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:16:05,917 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:16:06,113 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:16:06,114 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:16:06,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:16:06,114 INFO L85 PathProgramCache]: Analyzing trace with hash 273720844, now seen corresponding path program 3 times [2024-11-07 19:16:06,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:16:06,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795086733] [2024-11-07 19:16:06,115 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 19:16:06,115 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:16:06,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:16:06,118 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:16:06,122 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:16:06,205 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-07 19:16:06,205 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:16:06,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 19:16:06,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:16:06,626 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:16:06,627 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:16:06,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:16:06,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795086733] [2024-11-07 19:16:06,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795086733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:16:06,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:16:06,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 19:16:06,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710297852] [2024-11-07 19:16:06,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:16:06,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 19:16:06,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:16:06,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 19:16:06,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-07 19:16:06,638 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2024-11-07 19:16:06,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 120 flow. Second operand has 10 states, 10 states have (on average 20.6) internal successors, (206), 10 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:16:06,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:16:06,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2024-11-07 19:16:06,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:16:06,910 INFO L124 PetriNetUnfolderBase]: 337/678 cut-off events. [2024-11-07 19:16:06,910 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-07 19:16:06,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1379 conditions, 678 events. 337/678 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3302 event pairs, 101 based on Foata normal form. 8/638 useless extension candidates. Maximal degree in co-relation 1368. Up to 230 conditions per place. [2024-11-07 19:16:06,914 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 21 selfloop transitions, 4 changer transitions 20/66 dead transitions. [2024-11-07 19:16:06,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 66 transitions, 268 flow [2024-11-07 19:16:06,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 19:16:06,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 19:16:06,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2024-11-07 19:16:06,915 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5625 [2024-11-07 19:16:06,915 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 120 flow. Second operand 8 states and 198 transitions. [2024-11-07 19:16:06,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 66 transitions, 268 flow [2024-11-07 19:16:06,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 66 transitions, 257 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-07 19:16:06,919 INFO L231 Difference]: Finished difference. Result has 59 places, 40 transitions, 127 flow [2024-11-07 19:16:06,919 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=127, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2024-11-07 19:16:06,920 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2024-11-07 19:16:06,921 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 127 flow [2024-11-07 19:16:06,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 20.6) internal successors, (206), 10 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:16:06,921 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:16:06,921 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:16:06,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-07 19:16:07,121 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:16:07,122 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:16:07,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:16:07,122 INFO L85 PathProgramCache]: Analyzing trace with hash 596103760, now seen corresponding path program 4 times [2024-11-07 19:16:07,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:16:07,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1145899674] [2024-11-07 19:16:07,123 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-07 19:16:07,123 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:16:07,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:16:07,125 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:16:07,125 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:16:07,226 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-07 19:16:07,226 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-07 19:16:07,226 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:16:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:16:07,337 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-07 19:16:07,337 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:16:07,338 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-07 19:16:07,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-07 19:16:07,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-07 19:16:07,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-07 19:16:07,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-07 19:16:07,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-07 19:16:07,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-07 19:16:07,345 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:16:07,541 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:16:07,542 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-11-07 19:16:07,617 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 19:16:07,617 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 19:16:07,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:16:07 BasicIcfg [2024-11-07 19:16:07,625 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 19:16:07,626 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 19:16:07,626 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 19:16:07,626 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 19:16:07,627 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:16:01" (3/4) ... [2024-11-07 19:16:07,628 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 19:16:07,629 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 19:16:07,630 INFO L158 Benchmark]: Toolchain (without parser) took 7428.16ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 91.6MB in the beginning and 187.7MB in the end (delta: -96.1MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2024-11-07 19:16:07,630 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 117.4MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:16:07,630 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.17ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 68.4MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 19:16:07,631 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.27ms. Allocated memory is still 117.4MB. Free memory was 68.4MB in the beginning and 66.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:16:07,631 INFO L158 Benchmark]: Boogie Preprocessor took 42.64ms. Allocated memory is still 117.4MB. Free memory was 66.2MB in the beginning and 63.3MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:16:07,631 INFO L158 Benchmark]: RCFGBuilder took 693.40ms. Allocated memory is still 117.4MB. Free memory was 63.3MB in the beginning and 45.7MB in the end (delta: 17.5MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2024-11-07 19:16:07,631 INFO L158 Benchmark]: TraceAbstraction took 6214.01ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 45.2MB in the beginning and 187.7MB in the end (delta: -142.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:16:07,631 INFO L158 Benchmark]: Witness Printer took 2.79ms. Allocated memory is still 234.9MB. Free memory was 187.7MB in the beginning and 187.7MB in the end (delta: 57.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 19:16:07,632 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 117.4MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 415.17ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 68.4MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.27ms. Allocated memory is still 117.4MB. Free memory was 68.4MB in the beginning and 66.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.64ms. Allocated memory is still 117.4MB. Free memory was 66.2MB in the beginning and 63.3MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 693.40ms. Allocated memory is still 117.4MB. Free memory was 63.3MB in the beginning and 45.7MB in the end (delta: 17.5MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. * TraceAbstraction took 6214.01ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 45.2MB in the beginning and 187.7MB in the end (delta: -142.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.79ms. Allocated memory is still 234.9MB. Free memory was 187.7MB in the beginning and 187.7MB in the end (delta: 57.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1492; [L814] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1492=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, z=0] [L815] 0 pthread_t t1493; [L816] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1492=0, t1493=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, z=0] [L817] 0 pthread_t t1494; [L818] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1492=0, t1493=1, t1494=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, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L780] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L780] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0: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=0, y$r_buff0_thd3=1, 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, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0: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=0, y$r_buff0_thd3=1, 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, z=0] [L741] 1 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=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=0, y$r_buff0_thd3=1, 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, z=1] [L744] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=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=0, y$r_buff0_thd3=1, 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, z=1] [L756] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, 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, z=1] [L759] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, 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, z=1] [L762] 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) [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] 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 [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] 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}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, 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, z=1] [L791] 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) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 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 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 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}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, 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=1, 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, z=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, 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, z=1] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, 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, z=1] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=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=2, 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=1, 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, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492=0, t1493=1, t1494=2, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, 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, z=1] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 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) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 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 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 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_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492=0, t1493=1, t1494=2, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, 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, z=1] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 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) [L836] 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)) [L837] 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)) [L838] 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)) [L839] 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)) [L840] 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)) [L841] 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)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492=0, t1493=1, t1494=2, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=1] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=1] [L17] 0 __assert_fail ("0", "mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 814]: 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: 816]: 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: 818]: 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, 68 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: 6.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 283 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 267 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 849 IncrementalHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 10 mSDtfsCounter, 849 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 194 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=4, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 218 NumberOfCodeBlocks, 218 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 726 SizeOfPredicates, 12 NumberOfNonLiveVariables, 864 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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:16:07,654 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