./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix041_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/mix041_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', 'bcf8be2e0ebdad705b2868a16d6f5dfa937315d70be824d82e2d5945253ac067'] 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/mix041_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 bcf8be2e0ebdad705b2868a16d6f5dfa937315d70be824d82e2d5945253ac067 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:14:21,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:14:21,525 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:14:21,534 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:14:21,537 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:14:21,568 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:14:21,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:14:21,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:14:21,570 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:14:21,571 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:14:21,571 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:14:21,571 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:14:21,571 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:14:21,572 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:14:21,572 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:14:21,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:14:21,573 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:14:21,573 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:14:21,573 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:14:21,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:14:21,573 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 19:14:21,573 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 19:14:21,574 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 19:14:21,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:14:21,574 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:14:21,574 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:14:21,574 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:14:21,574 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:14:21,575 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:14:21,575 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:14:21,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:14:21,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:14:21,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:14:21,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:14:21,576 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:14:21,576 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:14:21,576 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 19:14:21,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 19:14:21,576 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:14:21,576 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:14:21,576 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:14:21,576 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:14:21,576 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 -> bcf8be2e0ebdad705b2868a16d6f5dfa937315d70be824d82e2d5945253ac067 [2024-11-07 19:14:21,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:14:21,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:14:21,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:14:21,853 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:14:21,853 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:14:21,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-11-07 19:14:23,182 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:14:23,432 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:14:23,433 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-11-07 19:14:23,445 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6dc57954a/f2e45a1bfaec493aa49acf64e66c4189/FLAG241f9f0a0 [2024-11-07 19:14:23,462 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6dc57954a/f2e45a1bfaec493aa49acf64e66c4189 [2024-11-07 19:14:23,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:14:23,466 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:14:23,468 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:14:23,468 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:14:23,472 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:14:23,472 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:14:23" (1/1) ... [2024-11-07 19:14:23,474 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@742d2ffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:23, skipping insertion in model container [2024-11-07 19:14:23,474 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:14:23" (1/1) ... [2024-11-07 19:14:23,498 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:14:23,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:14:23,765 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:14:23,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:14:23,868 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:14:23,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:23 WrapperNode [2024-11-07 19:14:23,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:14:23,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:14:23,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:14:23,871 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:14:23,876 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:14:23" (1/1) ... [2024-11-07 19:14:23,889 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:14:23" (1/1) ... [2024-11-07 19:14:23,911 INFO L138 Inliner]: procedures = 174, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 134 [2024-11-07 19:14:23,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:14:23,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:14:23,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:14:23,912 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:14:23,918 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:23" (1/1) ... [2024-11-07 19:14:23,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:23" (1/1) ... [2024-11-07 19:14:23,921 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:23" (1/1) ... [2024-11-07 19:14:23,940 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:14:23,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:23" (1/1) ... [2024-11-07 19:14:23,942 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:23" (1/1) ... [2024-11-07 19:14:23,947 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:23" (1/1) ... [2024-11-07 19:14:23,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:23" (1/1) ... [2024-11-07 19:14:23,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:23" (1/1) ... [2024-11-07 19:14:23,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:23" (1/1) ... [2024-11-07 19:14:23,953 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:14:23,954 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:14:23,954 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:14:23,954 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:14:23,955 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:23" (1/1) ... [2024-11-07 19:14:23,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:14:23,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:14:23,991 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:14:23,994 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:14:24,017 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-07 19:14:24,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:14:24,017 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-07 19:14:24,017 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-07 19:14:24,018 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-07 19:14:24,018 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-07 19:14:24,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 19:14:24,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-07 19:14:24,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:14:24,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:14:24,019 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:14:24,160 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:14:24,161 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:14:24,459 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 19:14:24,459 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:14:24,668 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:14:24,669 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 19:14:24,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:14:24 BoogieIcfgContainer [2024-11-07 19:14:24,669 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:14:24,671 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:14:24,672 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:14:24,676 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:14:24,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:14:23" (1/3) ... [2024-11-07 19:14:24,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d49674f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:14:24, skipping insertion in model container [2024-11-07 19:14:24,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:23" (2/3) ... [2024-11-07 19:14:24,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d49674f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:14:24, skipping insertion in model container [2024-11-07 19:14:24,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:14:24" (3/3) ... [2024-11-07 19:14:24,679 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-11-07 19:14:24,691 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:14:24,691 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-07 19:14:24,691 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 19:14:24,738 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 19:14:24,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 82 flow [2024-11-07 19:14:24,805 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2024-11-07 19:14:24,807 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:14:24,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 35 events. 2/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2024-11-07 19:14:24,812 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 37 transitions, 82 flow [2024-11-07 19:14:24,815 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 35 transitions, 76 flow [2024-11-07 19:14:24,821 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:14:24,830 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;@584f8467, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:14:24,830 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-07 19:14:24,835 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:14:24,835 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-11-07 19:14:24,835 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:14:24,835 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:14:24,835 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 19:14:24,836 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-07 19:14:24,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:14:24,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1812197485, now seen corresponding path program 1 times [2024-11-07 19:14:24,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:14:24,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495116845] [2024-11-07 19:14:24,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:14:24,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:14:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:14:25,305 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:14:25,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:14:25,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495116845] [2024-11-07 19:14:25,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495116845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:14:25,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:14:25,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:14:25,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015236816] [2024-11-07 19:14:25,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:14:25,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:14:25,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:14:25,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:14:25,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:14:25,337 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2024-11-07 19:14:25,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:14:25,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:14:25,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2024-11-07 19:14:25,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:14:25,535 INFO L124 PetriNetUnfolderBase]: 146/391 cut-off events. [2024-11-07 19:14:25,536 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:14:25,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 391 events. 146/391 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2222 event pairs, 20 based on Foata normal form. 24/409 useless extension candidates. Maximal degree in co-relation 654. Up to 208 conditions per place. [2024-11-07 19:14:25,540 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 23 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2024-11-07 19:14:25,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 142 flow [2024-11-07 19:14:25,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:14:25,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:14:25,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-11-07 19:14:25,551 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7207207207207207 [2024-11-07 19:14:25,552 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 76 flow. Second operand 3 states and 80 transitions. [2024-11-07 19:14:25,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 142 flow [2024-11-07 19:14:25,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:14:25,557 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 68 flow [2024-11-07 19:14:25,559 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-11-07 19:14:25,562 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2024-11-07 19:14:25,562 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 68 flow [2024-11-07 19:14:25,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:14:25,562 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:14:25,563 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:14:25,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 19:14:25,563 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-07 19:14:25,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:14:25,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1112992706, now seen corresponding path program 1 times [2024-11-07 19:14:25,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:14:25,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322612039] [2024-11-07 19:14:25,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:14:25,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:14:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:14:25,678 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:14:25,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:14:25,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322612039] [2024-11-07 19:14:25,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322612039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:14:25,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:14:25,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:14:25,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505465359] [2024-11-07 19:14:25,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:14:25,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:14:25,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:14:25,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:14:25,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:14:25,682 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-11-07 19:14:25,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:14:25,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:14:25,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-11-07 19:14:25,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:14:25,789 INFO L124 PetriNetUnfolderBase]: 129/299 cut-off events. [2024-11-07 19:14:25,789 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-11-07 19:14:25,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 567 conditions, 299 events. 129/299 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1639 event pairs, 129 based on Foata normal form. 12/296 useless extension candidates. Maximal degree in co-relation 557. Up to 232 conditions per place. [2024-11-07 19:14:25,794 INFO L140 encePairwiseOnDemand]: 35/37 looper letters, 14 selfloop transitions, 1 changer transitions 1/29 dead transitions. [2024-11-07 19:14:25,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 98 flow [2024-11-07 19:14:25,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:14:25,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:14:25,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2024-11-07 19:14:25,795 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5585585585585585 [2024-11-07 19:14:25,795 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 68 flow. Second operand 3 states and 62 transitions. [2024-11-07 19:14:25,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 98 flow [2024-11-07 19:14:25,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 29 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:14:25,796 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 62 flow [2024-11-07 19:14:25,797 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2024-11-07 19:14:25,798 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2024-11-07 19:14:25,798 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 62 flow [2024-11-07 19:14:25,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:14:25,799 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:14:25,799 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:14:25,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 19:14:25,799 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-07 19:14:25,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:14:25,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1112991302, now seen corresponding path program 1 times [2024-11-07 19:14:25,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:14:25,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132989449] [2024-11-07 19:14:25,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:14:25,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:14:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:14:26,133 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:14:26,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:14:26,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132989449] [2024-11-07 19:14:26,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132989449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:14:26,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:14:26,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:14:26,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105403531] [2024-11-07 19:14:26,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:14:26,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:14:26,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:14:26,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:14:26,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:14:26,142 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2024-11-07 19:14:26,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:14:26,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:14:26,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2024-11-07 19:14:26,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:14:26,408 INFO L124 PetriNetUnfolderBase]: 183/407 cut-off events. [2024-11-07 19:14:26,409 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:14:26,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 407 events. 183/407 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2246 event pairs, 45 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 744. Up to 151 conditions per place. [2024-11-07 19:14:26,412 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 19 selfloop transitions, 2 changer transitions 26/58 dead transitions. [2024-11-07 19:14:26,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 58 transitions, 216 flow [2024-11-07 19:14:26,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 19:14:26,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 19:14:26,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2024-11-07 19:14:26,415 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.543918918918919 [2024-11-07 19:14:26,415 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 62 flow. Second operand 8 states and 161 transitions. [2024-11-07 19:14:26,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 58 transitions, 216 flow [2024-11-07 19:14:26,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 58 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:14:26,419 INFO L231 Difference]: Finished difference. Result has 46 places, 27 transitions, 75 flow [2024-11-07 19:14:26,420 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=75, PETRI_PLACES=46, PETRI_TRANSITIONS=27} [2024-11-07 19:14:26,421 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2024-11-07 19:14:26,421 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 27 transitions, 75 flow [2024-11-07 19:14:26,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:14:26,422 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:14:26,422 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:14:26,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 19:14:26,422 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-07 19:14:26,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:14:26,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1597216247, now seen corresponding path program 1 times [2024-11-07 19:14:26,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:14:26,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052132234] [2024-11-07 19:14:26,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:14:26,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:14:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:14:27,412 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:14:27,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:14:27,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052132234] [2024-11-07 19:14:27,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052132234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:14:27,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:14:27,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:14:27,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851362282] [2024-11-07 19:14:27,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:14:27,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 19:14:27,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:14:27,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 19:14:27,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:14:27,420 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2024-11-07 19:14:27,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 27 transitions, 75 flow. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:14:27,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:14:27,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2024-11-07 19:14:27,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:14:27,716 INFO L124 PetriNetUnfolderBase]: 155/387 cut-off events. [2024-11-07 19:14:27,716 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2024-11-07 19:14:27,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 387 events. 155/387 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1995 event pairs, 67 based on Foata normal form. 12/397 useless extension candidates. Maximal degree in co-relation 792. Up to 225 conditions per place. [2024-11-07 19:14:27,730 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 23 selfloop transitions, 5 changer transitions 17/56 dead transitions. [2024-11-07 19:14:27,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 56 transitions, 235 flow [2024-11-07 19:14:27,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 19:14:27,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 19:14:27,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-11-07 19:14:27,735 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5371621621621622 [2024-11-07 19:14:27,735 INFO L175 Difference]: Start difference. First operand has 46 places, 27 transitions, 75 flow. Second operand 8 states and 159 transitions. [2024-11-07 19:14:27,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 56 transitions, 235 flow [2024-11-07 19:14:27,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 56 transitions, 215 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-07 19:14:27,742 INFO L231 Difference]: Finished difference. Result has 47 places, 31 transitions, 107 flow [2024-11-07 19:14:27,742 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=107, PETRI_PLACES=47, PETRI_TRANSITIONS=31} [2024-11-07 19:14:27,743 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2024-11-07 19:14:27,743 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 31 transitions, 107 flow [2024-11-07 19:14:27,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:14:27,743 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:14:27,743 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:14:27,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 19:14:27,744 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-07 19:14:27,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:14:27,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1415553566, now seen corresponding path program 1 times [2024-11-07 19:14:27,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:14:27,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828054620] [2024-11-07 19:14:27,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:14:27,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:14:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:14:27,953 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:14:27,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:14:27,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828054620] [2024-11-07 19:14:27,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828054620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:14:27,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:14:27,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:14:27,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833720342] [2024-11-07 19:14:27,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:14:27,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:14:27,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:14:27,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:14:27,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:14:27,958 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2024-11-07 19:14:27,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 31 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:14:27,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:14:27,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2024-11-07 19:14:27,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:14:28,091 INFO L124 PetriNetUnfolderBase]: 185/398 cut-off events. [2024-11-07 19:14:28,091 INFO L125 PetriNetUnfolderBase]: For 198/198 co-relation queries the response was YES. [2024-11-07 19:14:28,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 968 conditions, 398 events. 185/398 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1738 event pairs, 28 based on Foata normal form. 24/407 useless extension candidates. Maximal degree in co-relation 954. Up to 202 conditions per place. [2024-11-07 19:14:28,094 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 32 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2024-11-07 19:14:28,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 47 transitions, 229 flow [2024-11-07 19:14:28,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:14:28,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:14:28,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2024-11-07 19:14:28,095 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5945945945945946 [2024-11-07 19:14:28,095 INFO L175 Difference]: Start difference. First operand has 47 places, 31 transitions, 107 flow. Second operand 4 states and 88 transitions. [2024-11-07 19:14:28,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 47 transitions, 229 flow [2024-11-07 19:14:28,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 47 transitions, 225 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-07 19:14:28,097 INFO L231 Difference]: Finished difference. Result has 46 places, 34 transitions, 133 flow [2024-11-07 19:14:28,097 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2024-11-07 19:14:28,097 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2024-11-07 19:14:28,098 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 133 flow [2024-11-07 19:14:28,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:14:28,098 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:14:28,098 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:14:28,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 19:14:28,098 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-07 19:14:28,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:14:28,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1442058990, now seen corresponding path program 1 times [2024-11-07 19:14:28,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:14:28,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998240215] [2024-11-07 19:14:28,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:14:28,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:14:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:14:28,290 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:14:28,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:14:28,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998240215] [2024-11-07 19:14:28,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998240215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:14:28,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:14:28,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:14:28,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851116711] [2024-11-07 19:14:28,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:14:28,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:14:28,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:14:28,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:14:28,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:14:28,298 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2024-11-07 19:14:28,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:14:28,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:14:28,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2024-11-07 19:14:28,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:14:28,413 INFO L124 PetriNetUnfolderBase]: 114/257 cut-off events. [2024-11-07 19:14:28,413 INFO L125 PetriNetUnfolderBase]: For 191/191 co-relation queries the response was YES. [2024-11-07 19:14:28,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 257 events. 114/257 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 955 event pairs, 28 based on Foata normal form. 16/257 useless extension candidates. Maximal degree in co-relation 694. Up to 98 conditions per place. [2024-11-07 19:14:28,415 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 29 selfloop transitions, 6 changer transitions 0/46 dead transitions. [2024-11-07 19:14:28,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 240 flow [2024-11-07 19:14:28,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:14:28,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:14:28,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2024-11-07 19:14:28,417 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5405405405405406 [2024-11-07 19:14:28,417 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 133 flow. Second operand 5 states and 100 transitions. [2024-11-07 19:14:28,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 240 flow [2024-11-07 19:14:28,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 46 transitions, 219 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-11-07 19:14:28,420 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 146 flow [2024-11-07 19:14:28,421 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2024-11-07 19:14:28,422 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2024-11-07 19:14:28,422 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 146 flow [2024-11-07 19:14:28,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:14:28,423 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:14:28,423 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:14:28,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 19:14:28,423 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-07 19:14:28,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:14:28,424 INFO L85 PathProgramCache]: Analyzing trace with hash 50093053, now seen corresponding path program 1 times [2024-11-07 19:14:28,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:14:28,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840156278] [2024-11-07 19:14:28,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:14:28,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:14:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:14:28,981 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:14:28,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:14:28,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840156278] [2024-11-07 19:14:28,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840156278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:14:28,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:14:28,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 19:14:28,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515122636] [2024-11-07 19:14:28,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:14:28,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 19:14:28,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:14:28,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 19:14:28,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:14:28,997 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-11-07 19:14:28,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 146 flow. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:14:28,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:14:28,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-11-07 19:14:28,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:14:29,311 INFO L124 PetriNetUnfolderBase]: 148/381 cut-off events. [2024-11-07 19:14:29,311 INFO L125 PetriNetUnfolderBase]: For 290/322 co-relation queries the response was YES. [2024-11-07 19:14:29,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 381 events. 148/381 cut-off events. For 290/322 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1754 event pairs, 42 based on Foata normal form. 10/369 useless extension candidates. Maximal degree in co-relation 946. Up to 157 conditions per place. [2024-11-07 19:14:29,314 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 20 selfloop transitions, 3 changer transitions 27/64 dead transitions. [2024-11-07 19:14:29,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 64 transitions, 328 flow [2024-11-07 19:14:29,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 19:14:29,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 19:14:29,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-11-07 19:14:29,316 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4831081081081081 [2024-11-07 19:14:29,316 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 146 flow. Second operand 8 states and 143 transitions. [2024-11-07 19:14:29,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 64 transitions, 328 flow [2024-11-07 19:14:29,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 64 transitions, 319 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-07 19:14:29,321 INFO L231 Difference]: Finished difference. Result has 58 places, 33 transitions, 145 flow [2024-11-07 19:14:29,321 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=145, PETRI_PLACES=58, PETRI_TRANSITIONS=33} [2024-11-07 19:14:29,322 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2024-11-07 19:14:29,322 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 33 transitions, 145 flow [2024-11-07 19:14:29,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:14:29,322 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:14:29,322 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:14:29,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 19:14:29,322 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-07 19:14:29,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:14:29,322 INFO L85 PathProgramCache]: Analyzing trace with hash -140345323, now seen corresponding path program 2 times [2024-11-07 19:14:29,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:14:29,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038914041] [2024-11-07 19:14:29,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:14:29,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:14:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:14:29,400 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:14:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:14:29,486 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 19:14:29,487 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:14:29,487 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-11-07 19:14:29,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-07 19:14:29,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-11-07 19:14:29,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-07 19:14:29,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-07 19:14:29,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-11-07 19:14:29,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 19:14:29,493 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-11-07 19:14:29,562 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 19:14:29,562 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 19:14:29,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:14:29 BasicIcfg [2024-11-07 19:14:29,567 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 19:14:29,568 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 19:14:29,568 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 19:14:29,568 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 19:14:29,569 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:14:24" (3/4) ... [2024-11-07 19:14:29,570 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 19:14:29,571 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 19:14:29,571 INFO L158 Benchmark]: Toolchain (without parser) took 6105.41ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 90.4MB in the beginning and 84.6MB in the end (delta: 5.8MB). Peak memory consumption was 118.0MB. Max. memory is 16.1GB. [2024-11-07 19:14:29,572 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:14:29,572 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.88ms. Allocated memory is still 117.4MB. Free memory was 90.3MB in the beginning and 67.8MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 19:14:29,572 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.04ms. Allocated memory is still 117.4MB. Free memory was 67.8MB in the beginning and 65.4MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:14:29,572 INFO L158 Benchmark]: Boogie Preprocessor took 41.48ms. Allocated memory is still 117.4MB. Free memory was 65.3MB in the beginning and 62.6MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:14:29,572 INFO L158 Benchmark]: RCFGBuilder took 715.66ms. Allocated memory is still 117.4MB. Free memory was 62.5MB in the beginning and 62.4MB in the end (delta: 12.1kB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2024-11-07 19:14:29,573 INFO L158 Benchmark]: TraceAbstraction took 4895.77ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 62.0MB in the beginning and 84.6MB in the end (delta: -22.6MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. [2024-11-07 19:14:29,573 INFO L158 Benchmark]: Witness Printer took 2.97ms. Allocated memory is still 226.5MB. Free memory was 84.6MB in the beginning and 84.6MB in the end (delta: 45.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:14:29,574 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.18ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 401.88ms. Allocated memory is still 117.4MB. Free memory was 90.3MB in the beginning and 67.8MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.04ms. Allocated memory is still 117.4MB. Free memory was 67.8MB in the beginning and 65.4MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.48ms. Allocated memory is still 117.4MB. Free memory was 65.3MB in the beginning and 62.6MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 715.66ms. Allocated memory is still 117.4MB. Free memory was 62.5MB in the beginning and 62.4MB in the end (delta: 12.1kB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4895.77ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 62.0MB in the beginning and 84.6MB in the end (delta: -22.6MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. * Witness Printer took 2.97ms. Allocated memory is still 226.5MB. Free memory was 84.6MB in the beginning and 84.6MB in the end (delta: 45.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1091; [L803] FCALL, FORK 0 pthread_create(&t1091, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1091=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L804] 0 pthread_t t1092; [L805] FCALL, FORK 0 pthread_create(&t1092, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1091=-1, t1092=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L760] 2 x$w_buff1 = x$w_buff0 [L761] 2 x$w_buff0 = 2 [L762] 2 x$w_buff1_used = x$w_buff0_used [L763] 2 x$w_buff0_used = (_Bool)1 [L764] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L764] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L771] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L777] 2 __unbuffered_p1_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L740] 1 z = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L743] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L746] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1091=-1, t1092=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L809] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L809] RET 0 assume_abort_if_not(main$tmp_guard0) [L811] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L812] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L813] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L814] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L815] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1091=-1, t1092=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 x$flush_delayed = weak$$choice2 [L821] 0 x$mem_tmp = x [L822] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L823] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L824] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L825] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L826] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L828] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] 0 x = x$flush_delayed ? x$mem_tmp : x [L831] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1091=-1, t1092=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L833] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 800]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 803]: 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: 805]: 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 5 procedures, 55 locations, 6 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: 4.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 166 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 162 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 494 IncrementalHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 6 mSDtfsCounter, 494 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=6, InterpolantAutomatonStates: 39, 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.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 106 ConstructedInterpolants, 0 QuantifiedInterpolants, 542 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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:14:29,603 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/mix041_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 bcf8be2e0ebdad705b2868a16d6f5dfa937315d70be824d82e2d5945253ac067 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:14:31,747 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:14:31,859 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:14:31,867 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:14:31,867 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:14:31,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:14:31,899 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:14:31,899 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:14:31,900 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:14:31,900 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:14:31,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:14:31,901 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:14:31,902 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:14:31,902 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:14:31,903 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:14:31,903 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:14:31,903 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:14:31,903 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:14:31,903 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:14:31,903 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:14:31,903 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 19:14:31,903 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 19:14:31,903 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 19:14:31,903 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:14:31,903 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:14:31,903 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 19:14:31,903 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:14:31,903 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 19:14:31,904 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:14:31,904 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:14:31,904 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:14:31,904 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:14:31,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:14:31,904 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:14:31,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:14:31,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:14:31,904 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:14:31,904 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:14:31,904 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 19:14:31,904 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 19:14:31,904 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:14:31,904 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:14:31,904 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:14:31,905 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:14:31,905 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 -> bcf8be2e0ebdad705b2868a16d6f5dfa937315d70be824d82e2d5945253ac067 [2024-11-07 19:14:32,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:14:32,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:14:32,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:14:32,197 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:14:32,198 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:14:32,200 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-11-07 19:14:33,484 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:14:33,794 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:14:33,795 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-11-07 19:14:33,814 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a92f0a477/7235a1fa285b4ba7925b7d8ab8528de3/FLAGb3e0ab968 [2024-11-07 19:14:33,833 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a92f0a477/7235a1fa285b4ba7925b7d8ab8528de3 [2024-11-07 19:14:33,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:14:33,839 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:14:33,841 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:14:33,841 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:14:33,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:14:33,846 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:14:33" (1/1) ... [2024-11-07 19:14:33,849 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8ce0b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:33, skipping insertion in model container [2024-11-07 19:14:33,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:14:33" (1/1) ... [2024-11-07 19:14:33,888 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:14:34,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:14:34,218 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:14:34,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:14:34,337 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:14:34,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:34 WrapperNode [2024-11-07 19:14:34,339 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:14:34,340 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:14:34,340 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:14:34,340 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:14:34,347 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:14:34" (1/1) ... [2024-11-07 19:14:34,370 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:14:34" (1/1) ... [2024-11-07 19:14:34,407 INFO L138 Inliner]: procedures = 175, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 135 [2024-11-07 19:14:34,408 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:14:34,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:14:34,408 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:14:34,408 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:14:34,419 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:34" (1/1) ... [2024-11-07 19:14:34,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:34" (1/1) ... [2024-11-07 19:14:34,425 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:34" (1/1) ... [2024-11-07 19:14:34,440 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:14:34,441 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:34" (1/1) ... [2024-11-07 19:14:34,441 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:34" (1/1) ... [2024-11-07 19:14:34,454 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:34" (1/1) ... [2024-11-07 19:14:34,456 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:34" (1/1) ... [2024-11-07 19:14:34,462 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:34" (1/1) ... [2024-11-07 19:14:34,463 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:34" (1/1) ... [2024-11-07 19:14:34,470 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:14:34,471 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:14:34,474 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:14:34,474 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:14:34,475 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:34" (1/1) ... [2024-11-07 19:14:34,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:14:34,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:14:34,514 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:14:34,518 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:14:34,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-07 19:14:34,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:14:34,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 19:14:34,543 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-07 19:14:34,543 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-07 19:14:34,543 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-07 19:14:34,543 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-07 19:14:34,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-07 19:14:34,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:14:34,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:14:34,545 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:14:34,668 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:14:34,669 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:14:34,993 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 19:14:34,993 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:14:35,226 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:14:35,226 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 19:14:35,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:14:35 BoogieIcfgContainer [2024-11-07 19:14:35,227 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:14:35,231 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:14:35,231 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:14:35,236 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:14:35,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:14:33" (1/3) ... [2024-11-07 19:14:35,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@789217c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:14:35, skipping insertion in model container [2024-11-07 19:14:35,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:34" (2/3) ... [2024-11-07 19:14:35,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@789217c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:14:35, skipping insertion in model container [2024-11-07 19:14:35,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:14:35" (3/3) ... [2024-11-07 19:14:35,239 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-11-07 19:14:35,251 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:14:35,251 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-07 19:14:35,252 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 19:14:35,308 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 19:14:35,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 82 flow [2024-11-07 19:14:35,376 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2024-11-07 19:14:35,379 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:14:35,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 35 events. 2/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2024-11-07 19:14:35,386 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 37 transitions, 82 flow [2024-11-07 19:14:35,389 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 35 transitions, 76 flow [2024-11-07 19:14:35,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:14:35,407 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;@321c05cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:14:35,407 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-07 19:14:35,413 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:14:35,413 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-11-07 19:14:35,414 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:14:35,414 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:14:35,414 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 19:14:35,415 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-07 19:14:35,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:14:35,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1871364397, now seen corresponding path program 1 times [2024-11-07 19:14:35,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:14:35,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450244140] [2024-11-07 19:14:35,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:14:35,440 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:14:35,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:14:35,442 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:14:35,445 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:14:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:14:35,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 19:14:35,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:14:35,584 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:14:35,584 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:14:35,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:14:35,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450244140] [2024-11-07 19:14:35,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450244140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:14:35,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:14:35,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:14:35,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677643242] [2024-11-07 19:14:35,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:14:35,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:14:35,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:14:35,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:14:35,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:14:35,622 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2024-11-07 19:14:35,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:14:35,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:14:35,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2024-11-07 19:14:35,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:14:35,811 INFO L124 PetriNetUnfolderBase]: 146/391 cut-off events. [2024-11-07 19:14:35,811 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:14:35,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 391 events. 146/391 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2222 event pairs, 20 based on Foata normal form. 24/409 useless extension candidates. Maximal degree in co-relation 654. Up to 208 conditions per place. [2024-11-07 19:14:35,819 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 23 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2024-11-07 19:14:35,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 142 flow [2024-11-07 19:14:35,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:14:35,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:14:35,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-11-07 19:14:35,831 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7207207207207207 [2024-11-07 19:14:35,832 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 76 flow. Second operand 3 states and 80 transitions. [2024-11-07 19:14:35,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 142 flow [2024-11-07 19:14:35,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:14:35,840 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 68 flow [2024-11-07 19:14:35,842 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-11-07 19:14:35,846 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2024-11-07 19:14:35,846 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 68 flow [2024-11-07 19:14:35,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:14:35,847 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:14:35,847 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:14:35,851 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:14:36,047 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:14:36,048 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-07 19:14:36,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:14:36,048 INFO L85 PathProgramCache]: Analyzing trace with hash 571290304, now seen corresponding path program 1 times [2024-11-07 19:14:36,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:14:36,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372059769] [2024-11-07 19:14:36,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:14:36,049 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:14:36,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:14:36,053 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:14:36,054 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:14:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:14:36,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:14:36,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:14:36,175 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:14:36,175 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:14:36,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:14:36,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372059769] [2024-11-07 19:14:36,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372059769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:14:36,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:14:36,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:14:36,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317612533] [2024-11-07 19:14:36,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:14:36,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:14:36,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:14:36,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:14:36,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:14:36,191 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2024-11-07 19:14:36,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:14:36,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:14:36,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2024-11-07 19:14:36,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:14:36,414 INFO L124 PetriNetUnfolderBase]: 199/433 cut-off events. [2024-11-07 19:14:36,415 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-07 19:14:36,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 433 events. 199/433 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2187 event pairs, 24 based on Foata normal form. 20/441 useless extension candidates. Maximal degree in co-relation 829. Up to 232 conditions per place. [2024-11-07 19:14:36,423 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 30 selfloop transitions, 4 changer transitions 1/46 dead transitions. [2024-11-07 19:14:36,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 46 transitions, 176 flow [2024-11-07 19:14:36,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:14:36,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:14:36,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2024-11-07 19:14:36,424 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6013513513513513 [2024-11-07 19:14:36,424 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 68 flow. Second operand 4 states and 89 transitions. [2024-11-07 19:14:36,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 46 transitions, 176 flow [2024-11-07 19:14:36,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 46 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:14:36,427 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 90 flow [2024-11-07 19:14:36,427 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2024-11-07 19:14:36,428 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2024-11-07 19:14:36,428 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 90 flow [2024-11-07 19:14:36,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:14:36,428 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:14:36,428 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:14:36,432 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:14:36,631 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:14:36,632 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-07 19:14:36,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:14:36,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1752609003, now seen corresponding path program 1 times [2024-11-07 19:14:36,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:14:36,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1801420585] [2024-11-07 19:14:36,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:14:36,633 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:14:36,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:14:36,635 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:14:36,637 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:14:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:14:36,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 19:14:36,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:14:36,775 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:14:36,776 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:14:36,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:14:36,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1801420585] [2024-11-07 19:14:36,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1801420585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:14:36,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:14:36,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:14:36,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898841851] [2024-11-07 19:14:36,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:14:36,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:14:36,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:14:36,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:14:36,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:14:36,785 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2024-11-07 19:14:36,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 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:14:36,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:14:36,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2024-11-07 19:14:36,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:14:36,943 INFO L124 PetriNetUnfolderBase]: 92/210 cut-off events. [2024-11-07 19:14:36,943 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2024-11-07 19:14:36,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 210 events. 92/210 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 720 event pairs, 16 based on Foata normal form. 14/214 useless extension candidates. Maximal degree in co-relation 469. Up to 71 conditions per place. [2024-11-07 19:14:36,945 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 26 selfloop transitions, 6 changer transitions 1/44 dead transitions. [2024-11-07 19:14:36,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 44 transitions, 185 flow [2024-11-07 19:14:36,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:14:36,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:14:36,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2024-11-07 19:14:36,950 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5405405405405406 [2024-11-07 19:14:36,950 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 90 flow. Second operand 5 states and 100 transitions. [2024-11-07 19:14:36,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 44 transitions, 185 flow [2024-11-07 19:14:36,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 176 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-07 19:14:36,952 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 106 flow [2024-11-07 19:14:36,952 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=106, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2024-11-07 19:14:36,955 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2024-11-07 19:14:36,955 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 106 flow [2024-11-07 19:14:36,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 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:14:36,955 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:14:36,955 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:14:36,959 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:14:37,156 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:14:37,156 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-07 19:14:37,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:14:37,157 INFO L85 PathProgramCache]: Analyzing trace with hash -234171517, now seen corresponding path program 1 times [2024-11-07 19:14:37,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:14:37,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [362555487] [2024-11-07 19:14:37,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:14:37,158 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:14:37,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:14:37,160 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:14:37,161 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:14:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:14:37,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 19:14:37,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:14:37,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:14:37,294 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:14:37,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:14:37,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [362555487] [2024-11-07 19:14:37,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [362555487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:14:37,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:14:37,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:14:37,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364024477] [2024-11-07 19:14:37,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:14:37,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:14:37,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:14:37,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:14:37,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:14:37,299 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-11-07 19:14:37,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:14:37,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:14:37,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-11-07 19:14:37,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:14:37,349 INFO L124 PetriNetUnfolderBase]: 53/146 cut-off events. [2024-11-07 19:14:37,350 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-11-07 19:14:37,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309 conditions, 146 events. 53/146 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 469 event pairs, 52 based on Foata normal form. 4/137 useless extension candidates. Maximal degree in co-relation 295. Up to 109 conditions per place. [2024-11-07 19:14:37,351 INFO L140 encePairwiseOnDemand]: 35/37 looper letters, 14 selfloop transitions, 1 changer transitions 1/31 dead transitions. [2024-11-07 19:14:37,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 136 flow [2024-11-07 19:14:37,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:14:37,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:14:37,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2024-11-07 19:14:37,352 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5585585585585585 [2024-11-07 19:14:37,352 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 106 flow. Second operand 3 states and 62 transitions. [2024-11-07 19:14:37,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 136 flow [2024-11-07 19:14:37,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 108 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-11-07 19:14:37,354 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 76 flow [2024-11-07 19:14:37,354 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2024-11-07 19:14:37,354 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2024-11-07 19:14:37,354 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 76 flow [2024-11-07 19:14:37,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:14:37,355 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:14:37,355 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:14:37,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 19:14:37,555 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:14:37,555 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-07 19:14:37,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:14:37,556 INFO L85 PathProgramCache]: Analyzing trace with hash -234170113, now seen corresponding path program 1 times [2024-11-07 19:14:37,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:14:37,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106971819] [2024-11-07 19:14:37,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:14:37,557 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:14:37,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:14:37,558 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:14:37,559 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:14:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:14:37,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 19:14:37,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:14:38,010 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:14:38,010 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:14:38,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:14:38,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106971819] [2024-11-07 19:14:38,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2106971819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:14:38,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:14:38,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:14:38,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185983414] [2024-11-07 19:14:38,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:14:38,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:14:38,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:14:38,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:14:38,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:14:38,025 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2024-11-07 19:14:38,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 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:14:38,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:14:38,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2024-11-07 19:14:38,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:14:38,216 INFO L124 PetriNetUnfolderBase]: 108/272 cut-off events. [2024-11-07 19:14:38,217 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:14:38,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 272 events. 108/272 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1082 event pairs, 30 based on Foata normal form. 4/268 useless extension candidates. Maximal degree in co-relation 517. Up to 118 conditions per place. [2024-11-07 19:14:38,218 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 19 selfloop transitions, 1 changer transitions 17/50 dead transitions. [2024-11-07 19:14:38,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 192 flow [2024-11-07 19:14:38,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:14:38,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:14:38,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2024-11-07 19:14:38,220 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5495495495495496 [2024-11-07 19:14:38,220 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 76 flow. Second operand 6 states and 122 transitions. [2024-11-07 19:14:38,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 192 flow [2024-11-07 19:14:38,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 50 transitions, 191 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:14:38,221 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 86 flow [2024-11-07 19:14:38,222 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=86, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2024-11-07 19:14:38,222 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2024-11-07 19:14:38,222 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 86 flow [2024-11-07 19:14:38,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 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:14:38,223 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:14:38,223 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:14:38,227 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:14:38,423 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:14:38,424 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-07 19:14:38,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:14:38,424 INFO L85 PathProgramCache]: Analyzing trace with hash -192868403, now seen corresponding path program 2 times [2024-11-07 19:14:38,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:14:38,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1386450710] [2024-11-07 19:14:38,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 19:14:38,425 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:14:38,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:14:38,427 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:14:38,428 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:14:38,505 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 19:14:38,505 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:14:38,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 19:14:38,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:14:38,841 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:14:38,842 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:14:38,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:14:38,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1386450710] [2024-11-07 19:14:38,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1386450710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:14:38,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:14:38,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 19:14:38,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301870619] [2024-11-07 19:14:38,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:14:38,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 19:14:38,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:14:38,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 19:14:38,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-07 19:14:38,853 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-11-07 19:14:38,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 86 flow. Second operand has 10 states, 10 states have (on average 16.4) internal successors, (164), 10 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:14:38,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:14:38,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-11-07 19:14:38,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:14:39,037 INFO L124 PetriNetUnfolderBase]: 93/251 cut-off events. [2024-11-07 19:14:39,037 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-07 19:14:39,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 251 events. 93/251 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 972 event pairs, 29 based on Foata normal form. 4/244 useless extension candidates. Maximal degree in co-relation 491. Up to 80 conditions per place. [2024-11-07 19:14:39,039 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 16 selfloop transitions, 3 changer transitions 16/49 dead transitions. [2024-11-07 19:14:39,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 49 transitions, 200 flow [2024-11-07 19:14:39,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 19:14:39,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-07 19:14:39,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2024-11-07 19:14:39,040 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5444015444015444 [2024-11-07 19:14:39,040 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 86 flow. Second operand 7 states and 141 transitions. [2024-11-07 19:14:39,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 49 transitions, 200 flow [2024-11-07 19:14:39,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 49 transitions, 189 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-07 19:14:39,042 INFO L231 Difference]: Finished difference. Result has 49 places, 30 transitions, 96 flow [2024-11-07 19:14:39,042 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=96, PETRI_PLACES=49, PETRI_TRANSITIONS=30} [2024-11-07 19:14:39,043 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2024-11-07 19:14:39,043 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 30 transitions, 96 flow [2024-11-07 19:14:39,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.4) internal successors, (164), 10 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:14:39,043 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:14:39,043 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:14:39,048 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:14:39,244 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:14:39,244 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-07 19:14:39,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:14:39,245 INFO L85 PathProgramCache]: Analyzing trace with hash -114425661, now seen corresponding path program 3 times [2024-11-07 19:14:39,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:14:39,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1600903181] [2024-11-07 19:14:39,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 19:14:39,245 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:14:39,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:14:39,248 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:14:39,250 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:14:39,323 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-07 19:14:39,324 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-07 19:14:39,324 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:14:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:14:39,409 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-07 19:14:39,409 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:14:39,410 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-11-07 19:14:39,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-07 19:14:39,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-11-07 19:14:39,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-07 19:14:39,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-07 19:14:39,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-11-07 19:14:39,417 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 (8)] Forceful destruction successful, exit code 0 [2024-11-07 19:14:39,612 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:14:39,613 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2024-11-07 19:14:39,702 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 19:14:39,703 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 19:14:39,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:14:39 BasicIcfg [2024-11-07 19:14:39,707 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 19:14:39,708 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 19:14:39,708 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 19:14:39,708 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 19:14:39,710 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:14:35" (3/4) ... [2024-11-07 19:14:39,711 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 19:14:39,713 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 19:14:39,714 INFO L158 Benchmark]: Toolchain (without parser) took 5874.78ms. Allocated memory was 83.9MB in the beginning and 134.2MB in the end (delta: 50.3MB). Free memory was 59.0MB in the beginning and 100.4MB in the end (delta: -41.5MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2024-11-07 19:14:39,714 INFO L158 Benchmark]: CDTParser took 1.06ms. Allocated memory is still 83.9MB. Free memory is still 65.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:14:39,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 498.35ms. Allocated memory is still 83.9MB. Free memory was 59.0MB in the beginning and 36.1MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 19:14:39,714 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.37ms. Allocated memory is still 83.9MB. Free memory was 36.1MB in the beginning and 33.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:14:39,714 INFO L158 Benchmark]: Boogie Preprocessor took 61.59ms. Allocated memory is still 83.9MB. Free memory was 33.8MB in the beginning and 31.2MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:14:39,715 INFO L158 Benchmark]: RCFGBuilder took 756.08ms. Allocated memory is still 83.9MB. Free memory was 31.2MB in the beginning and 41.2MB in the end (delta: -10.0MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2024-11-07 19:14:39,715 INFO L158 Benchmark]: TraceAbstraction took 4476.66ms. Allocated memory was 83.9MB in the beginning and 134.2MB in the end (delta: 50.3MB). Free memory was 40.7MB in the beginning and 100.5MB in the end (delta: -59.8MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. [2024-11-07 19:14:39,715 INFO L158 Benchmark]: Witness Printer took 5.56ms. Allocated memory is still 134.2MB. Free memory was 100.5MB in the beginning and 100.4MB in the end (delta: 8.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:14:39,716 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.06ms. Allocated memory is still 83.9MB. Free memory is still 65.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 498.35ms. Allocated memory is still 83.9MB. Free memory was 59.0MB in the beginning and 36.1MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.37ms. Allocated memory is still 83.9MB. Free memory was 36.1MB in the beginning and 33.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 61.59ms. Allocated memory is still 83.9MB. Free memory was 33.8MB in the beginning and 31.2MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 756.08ms. Allocated memory is still 83.9MB. Free memory was 31.2MB in the beginning and 41.2MB in the end (delta: -10.0MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4476.66ms. Allocated memory was 83.9MB in the beginning and 134.2MB in the end (delta: 50.3MB). Free memory was 40.7MB in the beginning and 100.5MB in the end (delta: -59.8MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. * Witness Printer took 5.56ms. Allocated memory is still 134.2MB. Free memory was 100.5MB in the beginning and 100.4MB in the end (delta: 8.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1091; [L803] FCALL, FORK 0 pthread_create(&t1091, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1091=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L804] 0 pthread_t t1092; [L805] FCALL, FORK 0 pthread_create(&t1092, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1091=-1, t1092=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L760] 2 x$w_buff1 = x$w_buff0 [L761] 2 x$w_buff0 = 2 [L762] 2 x$w_buff1_used = x$w_buff0_used [L763] 2 x$w_buff0_used = (_Bool)1 [L764] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L764] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L771] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L777] 2 __unbuffered_p1_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L740] 1 z = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L743] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L746] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1091=-1, t1092=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L809] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L809] RET 0 assume_abort_if_not(main$tmp_guard0) [L811] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L812] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L813] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L814] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L815] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1091=-1, t1092=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 x$flush_delayed = weak$$choice2 [L821] 0 x$mem_tmp = x [L822] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L823] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L824] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L825] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L826] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L828] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] 0 x = x$flush_delayed ? x$mem_tmp : x [L831] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1091=-1, t1092=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L833] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 800]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 803]: 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: 805]: 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 5 procedures, 55 locations, 6 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: 4.3s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 150 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 139 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 448 IncrementalHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 4 mSDtfsCounter, 448 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=3, InterpolantAutomatonStates: 28, 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.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 137 NumberOfCodeBlocks, 137 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 106 ConstructedInterpolants, 0 QuantifiedInterpolants, 489 SizeOfPredicates, 8 NumberOfNonLiveVariables, 562 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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:14:39,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample