./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 649d1c1aa65cb6010503451d39379fb2c9cafcc7e0f5f23661f58b5d14c46288 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:30:52,961 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:30:52,964 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:30:53,009 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:30:53,009 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:30:53,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:30:53,014 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:30:53,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:30:53,019 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:30:53,024 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:30:53,025 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:30:53,027 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:30:53,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:30:53,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:30:53,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:30:53,036 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:30:53,037 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:30:53,038 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:30:53,041 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:30:53,045 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:30:53,046 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:30:53,047 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:30:53,050 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:30:53,051 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:30:53,058 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:30:53,058 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:30:53,059 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:30:53,060 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:30:53,061 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:30:53,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:30:53,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:30:53,067 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:30:53,069 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:30:53,069 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:30:53,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:30:53,071 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:30:53,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:30:53,072 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:30:53,072 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:30:53,073 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:30:53,085 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:30:53,087 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 20:30:53,118 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:30:53,118 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:30:53,120 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:30:53,120 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:30:53,121 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:30:53,121 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:30:53,122 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:30:53,122 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:30:53,122 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:30:53,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:30:53,123 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:30:53,123 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:30:53,123 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:30:53,124 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:30:53,124 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:30:53,124 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:30:53,124 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:30:53,124 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:30:53,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:30:53,125 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:30:53,125 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:30:53,125 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:30:53,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:30:53,126 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:30:53,126 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:30:53,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:30:53,126 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:30:53,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:30:53,127 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:30:53,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:30:53,127 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:30:53,127 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:30:53,128 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:30:53,128 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:30:53,128 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 649d1c1aa65cb6010503451d39379fb2c9cafcc7e0f5f23661f58b5d14c46288 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 20:30:53,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:30:53,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:30:53,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:30:53,513 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:30:53,513 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:30:53,515 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:30:54,745 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:30:54,972 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:30:54,977 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:30:54,999 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/876dbe45b/2f72d4310ef5407988a5bc3dd0b4f94b/FLAGbecc78c0f [2023-08-29 20:30:55,020 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/876dbe45b/2f72d4310ef5407988a5bc3dd0b4f94b [2023-08-29 20:30:55,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:30:55,024 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:30:55,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:30:55,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:30:55,029 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:30:55,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:30:55" (1/1) ... [2023-08-29 20:30:55,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fc04631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:55, skipping insertion in model container [2023-08-29 20:30:55,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:30:55" (1/1) ... [2023-08-29 20:30:55,055 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:30:55,106 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:30:55,268 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-29 20:30:55,502 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:30:55,514 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:30:55,529 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-29 20:30:55,598 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:30:55,625 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:30:55,625 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:30:55,631 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:30:55,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:55 WrapperNode [2023-08-29 20:30:55,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:30:55,634 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:30:55,634 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:30:55,634 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:30:55,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:55" (1/1) ... [2023-08-29 20:30:55,669 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:55" (1/1) ... [2023-08-29 20:30:55,713 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2023-08-29 20:30:55,714 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:30:55,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:30:55,715 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:30:55,715 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:30:55,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:55" (1/1) ... [2023-08-29 20:30:55,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:55" (1/1) ... [2023-08-29 20:30:55,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:55" (1/1) ... [2023-08-29 20:30:55,742 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:55" (1/1) ... [2023-08-29 20:30:55,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:55" (1/1) ... [2023-08-29 20:30:55,764 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:55" (1/1) ... [2023-08-29 20:30:55,766 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:55" (1/1) ... [2023-08-29 20:30:55,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:55" (1/1) ... [2023-08-29 20:30:55,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:30:55,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:30:55,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:30:55,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:30:55,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:55" (1/1) ... [2023-08-29 20:30:55,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:30:55,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:30:55,814 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 20:30:55,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 20:30:55,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:30:55,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:30:55,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:30:55,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:30:55,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:30:55,849 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:30:55,850 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:30:55,850 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:30:55,850 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:30:55,850 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:30:55,850 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:30:55,850 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-29 20:30:55,850 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-29 20:30:55,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:30:55,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:30:55,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:30:55,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:30:55,852 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:30:56,034 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:30:56,036 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:30:56,454 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:30:56,563 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:30:56,563 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:30:56,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:30:56 BoogieIcfgContainer [2023-08-29 20:30:56,566 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:30:56,568 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:30:56,568 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:30:56,571 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:30:56,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:30:55" (1/3) ... [2023-08-29 20:30:56,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a53f62b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:30:56, skipping insertion in model container [2023-08-29 20:30:56,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:55" (2/3) ... [2023-08-29 20:30:56,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a53f62b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:30:56, skipping insertion in model container [2023-08-29 20:30:56,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:30:56" (3/3) ... [2023-08-29 20:30:56,573 INFO L112 eAbstractionObserver]: Analyzing ICFG mix057_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:30:56,588 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:30:56,589 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-29 20:30:56,589 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:30:56,637 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:30:56,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 139 transitions, 298 flow [2023-08-29 20:30:56,771 INFO L130 PetriNetUnfolder]: 2/135 cut-off events. [2023-08-29 20:30:56,774 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:30:56,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 135 events. 2/135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-29 20:30:56,780 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 139 transitions, 298 flow [2023-08-29 20:30:56,785 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 146 places, 135 transitions, 282 flow [2023-08-29 20:30:56,790 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:30:56,800 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 135 transitions, 282 flow [2023-08-29 20:30:56,802 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 135 transitions, 282 flow [2023-08-29 20:30:56,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 135 transitions, 282 flow [2023-08-29 20:30:56,857 INFO L130 PetriNetUnfolder]: 2/135 cut-off events. [2023-08-29 20:30:56,857 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:30:56,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 135 events. 2/135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-29 20:30:56,863 INFO L119 LiptonReduction]: Number of co-enabled transitions 3412 [2023-08-29 20:31:01,101 INFO L134 LiptonReduction]: Checked pairs total: 9326 [2023-08-29 20:31:01,101 INFO L136 LiptonReduction]: Total number of compositions: 132 [2023-08-29 20:31:01,111 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:31:01,116 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@22d975d9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:31:01,116 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-29 20:31:01,121 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 20:31:01,121 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:31:01,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:01,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:31:01,122 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:01,126 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:01,127 INFO L85 PathProgramCache]: Analyzing trace with hash 595, now seen corresponding path program 1 times [2023-08-29 20:31:01,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:31:01,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763679524] [2023-08-29 20:31:01,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:01,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:31:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:01,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:01,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:31:01,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763679524] [2023-08-29 20:31:01,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763679524] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:01,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:01,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:31:01,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738283581] [2023-08-29 20:31:01,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:01,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:31:01,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:31:01,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:31:01,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:31:01,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 271 [2023-08-29 20:31:01,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 124.5) internal successors, (249), 2 states have internal predecessors, (249), 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) [2023-08-29 20:31:01,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:01,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 271 [2023-08-29 20:31:01,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:02,808 INFO L130 PetriNetUnfolder]: 9959/13406 cut-off events. [2023-08-29 20:31:02,809 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2023-08-29 20:31:02,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26994 conditions, 13406 events. 9959/13406 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 68812 event pairs, 9959 based on Foata normal form. 400/11894 useless extension candidates. Maximal degree in co-relation 26982. Up to 13371 conditions per place. [2023-08-29 20:31:02,896 INFO L137 encePairwiseOnDemand]: 262/271 looper letters, 29 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-08-29 20:31:02,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 134 flow [2023-08-29 20:31:02,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:31:02,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:31:02,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 286 transitions. [2023-08-29 20:31:02,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5276752767527675 [2023-08-29 20:31:02,907 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 286 transitions. [2023-08-29 20:31:02,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 286 transitions. [2023-08-29 20:31:02,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:02,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 286 transitions. [2023-08-29 20:31:02,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 143.0) internal successors, (286), 2 states have internal predecessors, (286), 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) [2023-08-29 20:31:02,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 271.0) internal successors, (813), 3 states have internal predecessors, (813), 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) [2023-08-29 20:31:02,917 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 271.0) internal successors, (813), 3 states have internal predecessors, (813), 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) [2023-08-29 20:31:02,918 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 286 transitions. [2023-08-29 20:31:02,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 134 flow [2023-08-29 20:31:02,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:31:02,926 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-08-29 20:31:02,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-08-29 20:31:02,932 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-08-29 20:31:02,932 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-08-29 20:31:02,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 124.5) internal successors, (249), 2 states have internal predecessors, (249), 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) [2023-08-29 20:31:02,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:02,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:31:02,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:31:02,938 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:02,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:02,939 INFO L85 PathProgramCache]: Analyzing trace with hash 584553, now seen corresponding path program 1 times [2023-08-29 20:31:02,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:31:02,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347148642] [2023-08-29 20:31:02,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:02,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:31:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:03,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:03,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:31:03,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347148642] [2023-08-29 20:31:03,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347148642] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:03,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:03,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:31:03,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100685416] [2023-08-29 20:31:03,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:03,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:31:03,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:31:03,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:31:03,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:31:03,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 271 [2023-08-29 20:31:03,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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) [2023-08-29 20:31:03,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:03,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 271 [2023-08-29 20:31:03,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:04,251 INFO L130 PetriNetUnfolder]: 7831/10741 cut-off events. [2023-08-29 20:31:04,252 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:31:04,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21474 conditions, 10741 events. 7831/10741 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 55806 event pairs, 2967 based on Foata normal form. 0/9775 useless extension candidates. Maximal degree in co-relation 21471. Up to 8431 conditions per place. [2023-08-29 20:31:04,314 INFO L137 encePairwiseOnDemand]: 268/271 looper letters, 45 selfloop transitions, 2 changer transitions 4/54 dead transitions. [2023-08-29 20:31:04,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 54 transitions, 224 flow [2023-08-29 20:31:04,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:31:04,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:31:04,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-08-29 20:31:04,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5178351783517835 [2023-08-29 20:31:04,319 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-08-29 20:31:04,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-08-29 20:31:04,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:04,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-08-29 20:31:04,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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) [2023-08-29 20:31:04,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 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) [2023-08-29 20:31:04,326 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 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) [2023-08-29 20:31:04,327 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 421 transitions. [2023-08-29 20:31:04,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 54 transitions, 224 flow [2023-08-29 20:31:04,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 224 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:31:04,328 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 70 flow [2023-08-29 20:31:04,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, 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=70, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2023-08-29 20:31:04,329 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-08-29 20:31:04,329 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 70 flow [2023-08-29 20:31:04,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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) [2023-08-29 20:31:04,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:04,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:04,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:31:04,331 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:04,332 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:04,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1093734732, now seen corresponding path program 1 times [2023-08-29 20:31:04,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:31:04,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373314108] [2023-08-29 20:31:04,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:04,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:31:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:05,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:05,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:31:05,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373314108] [2023-08-29 20:31:05,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373314108] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:05,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:05,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:31:05,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340865458] [2023-08-29 20:31:05,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:05,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:31:05,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:31:05,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:31:05,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:31:05,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 271 [2023-08-29 20:31:05,268 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 70 flow. Second operand has 6 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 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) [2023-08-29 20:31:05,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:05,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 271 [2023-08-29 20:31:05,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:06,052 INFO L130 PetriNetUnfolder]: 4903/6689 cut-off events. [2023-08-29 20:31:06,053 INFO L131 PetriNetUnfolder]: For 441/441 co-relation queries the response was YES. [2023-08-29 20:31:06,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13978 conditions, 6689 events. 4903/6689 cut-off events. For 441/441 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 32487 event pairs, 1056 based on Foata normal form. 0/6689 useless extension candidates. Maximal degree in co-relation 13974. Up to 6432 conditions per place. [2023-08-29 20:31:06,087 INFO L137 encePairwiseOnDemand]: 266/271 looper letters, 39 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2023-08-29 20:31:06,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 196 flow [2023-08-29 20:31:06,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:31:06,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:31:06,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 674 transitions. [2023-08-29 20:31:06,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4145141451414514 [2023-08-29 20:31:06,091 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 674 transitions. [2023-08-29 20:31:06,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 674 transitions. [2023-08-29 20:31:06,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:06,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 674 transitions. [2023-08-29 20:31:06,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 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) [2023-08-29 20:31:06,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 271.0) internal successors, (1897), 7 states have internal predecessors, (1897), 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) [2023-08-29 20:31:06,097 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 271.0) internal successors, (1897), 7 states have internal predecessors, (1897), 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) [2023-08-29 20:31:06,097 INFO L175 Difference]: Start difference. First operand has 43 places, 29 transitions, 70 flow. Second operand 6 states and 674 transitions. [2023-08-29 20:31:06,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 196 flow [2023-08-29 20:31:06,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 186 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:31:06,100 INFO L231 Difference]: Finished difference. Result has 43 places, 28 transitions, 72 flow [2023-08-29 20:31:06,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2023-08-29 20:31:06,101 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-08-29 20:31:06,104 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 72 flow [2023-08-29 20:31:06,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 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) [2023-08-29 20:31:06,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:06,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:06,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:31:06,106 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:06,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:06,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1093734783, now seen corresponding path program 1 times [2023-08-29 20:31:06,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:31:06,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999574508] [2023-08-29 20:31:06,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:06,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:31:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:06,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:06,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:31:06,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999574508] [2023-08-29 20:31:06,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999574508] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:06,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:06,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:31:06,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276393341] [2023-08-29 20:31:06,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:06,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:31:06,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:31:06,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:31:06,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:31:06,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 271 [2023-08-29 20:31:06,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 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) [2023-08-29 20:31:06,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:06,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 271 [2023-08-29 20:31:06,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:08,565 INFO L130 PetriNetUnfolder]: 20150/27327 cut-off events. [2023-08-29 20:31:08,565 INFO L131 PetriNetUnfolder]: For 184/184 co-relation queries the response was YES. [2023-08-29 20:31:08,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55252 conditions, 27327 events. 20150/27327 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 934. Compared 148219 event pairs, 6792 based on Foata normal form. 1132/28459 useless extension candidates. Maximal degree in co-relation 55248. Up to 11608 conditions per place. [2023-08-29 20:31:08,660 INFO L137 encePairwiseOnDemand]: 261/271 looper letters, 43 selfloop transitions, 8 changer transitions 33/84 dead transitions. [2023-08-29 20:31:08,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 84 transitions, 360 flow [2023-08-29 20:31:08,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:31:08,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:31:08,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 651 transitions. [2023-08-29 20:31:08,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48044280442804427 [2023-08-29 20:31:08,663 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 651 transitions. [2023-08-29 20:31:08,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 651 transitions. [2023-08-29 20:31:08,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:08,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 651 transitions. [2023-08-29 20:31:08,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 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) [2023-08-29 20:31:08,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 271.0) internal successors, (1626), 6 states have internal predecessors, (1626), 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) [2023-08-29 20:31:08,669 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 271.0) internal successors, (1626), 6 states have internal predecessors, (1626), 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) [2023-08-29 20:31:08,669 INFO L175 Difference]: Start difference. First operand has 43 places, 28 transitions, 72 flow. Second operand 5 states and 651 transitions. [2023-08-29 20:31:08,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 84 transitions, 360 flow [2023-08-29 20:31:08,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 84 transitions, 350 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:31:08,671 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 145 flow [2023-08-29 20:31:08,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=145, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2023-08-29 20:31:08,673 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2023-08-29 20:31:08,673 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 145 flow [2023-08-29 20:31:08,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 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) [2023-08-29 20:31:08,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:08,674 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:08,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:31:08,674 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:08,675 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:08,675 INFO L85 PathProgramCache]: Analyzing trace with hash 454003541, now seen corresponding path program 1 times [2023-08-29 20:31:08,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:31:08,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635232448] [2023-08-29 20:31:08,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:08,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:31:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:08,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:08,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:31:08,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635232448] [2023-08-29 20:31:08,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635232448] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:08,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:08,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:31:08,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505915490] [2023-08-29 20:31:08,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:08,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:31:08,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:31:08,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:31:08,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:31:08,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 271 [2023-08-29 20:31:08,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 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) [2023-08-29 20:31:08,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:08,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 271 [2023-08-29 20:31:08,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:11,113 INFO L130 PetriNetUnfolder]: 18751/25648 cut-off events. [2023-08-29 20:31:11,113 INFO L131 PetriNetUnfolder]: For 21058/21058 co-relation queries the response was YES. [2023-08-29 20:31:11,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71942 conditions, 25648 events. 18751/25648 cut-off events. For 21058/21058 co-relation queries the response was YES. Maximal size of possible extension queue 885. Compared 141138 event pairs, 2075 based on Foata normal form. 1074/26722 useless extension candidates. Maximal degree in co-relation 71935. Up to 10896 conditions per place. [2023-08-29 20:31:11,257 INFO L137 encePairwiseOnDemand]: 261/271 looper letters, 60 selfloop transitions, 12 changer transitions 49/121 dead transitions. [2023-08-29 20:31:11,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 121 transitions, 721 flow [2023-08-29 20:31:11,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:31:11,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:31:11,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 904 transitions. [2023-08-29 20:31:11,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4765419082762256 [2023-08-29 20:31:11,261 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 904 transitions. [2023-08-29 20:31:11,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 904 transitions. [2023-08-29 20:31:11,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:11,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 904 transitions. [2023-08-29 20:31:11,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.14285714285714) internal successors, (904), 7 states have internal predecessors, (904), 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) [2023-08-29 20:31:11,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 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) [2023-08-29 20:31:11,269 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 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) [2023-08-29 20:31:11,269 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 145 flow. Second operand 7 states and 904 transitions. [2023-08-29 20:31:11,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 121 transitions, 721 flow [2023-08-29 20:31:11,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 121 transitions, 667 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:31:11,311 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 245 flow [2023-08-29 20:31:11,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=245, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2023-08-29 20:31:11,314 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2023-08-29 20:31:11,314 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 245 flow [2023-08-29 20:31:11,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 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) [2023-08-29 20:31:11,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:11,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:11,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:31:11,315 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:11,315 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:11,316 INFO L85 PathProgramCache]: Analyzing trace with hash 453984321, now seen corresponding path program 1 times [2023-08-29 20:31:11,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:31:11,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15247224] [2023-08-29 20:31:11,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:11,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:31:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:11,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:11,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:31:11,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15247224] [2023-08-29 20:31:11,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15247224] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:11,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:11,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:31:11,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107615823] [2023-08-29 20:31:11,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:11,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:31:11,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:31:11,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:31:11,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:31:11,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 271 [2023-08-29 20:31:11,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 245 flow. Second operand has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 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) [2023-08-29 20:31:11,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:11,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 271 [2023-08-29 20:31:11,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:13,802 INFO L130 PetriNetUnfolder]: 17836/24403 cut-off events. [2023-08-29 20:31:13,803 INFO L131 PetriNetUnfolder]: For 55688/55688 co-relation queries the response was YES. [2023-08-29 20:31:13,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77819 conditions, 24403 events. 17836/24403 cut-off events. For 55688/55688 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 133168 event pairs, 3396 based on Foata normal form. 902/25305 useless extension candidates. Maximal degree in co-relation 77807. Up to 10596 conditions per place. [2023-08-29 20:31:13,920 INFO L137 encePairwiseOnDemand]: 261/271 looper letters, 66 selfloop transitions, 20 changer transitions 45/131 dead transitions. [2023-08-29 20:31:13,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 131 transitions, 897 flow [2023-08-29 20:31:13,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:31:13,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:31:13,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 905 transitions. [2023-08-29 20:31:13,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47706905640484976 [2023-08-29 20:31:13,924 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 905 transitions. [2023-08-29 20:31:13,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 905 transitions. [2023-08-29 20:31:13,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:13,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 905 transitions. [2023-08-29 20:31:13,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.28571428571428) internal successors, (905), 7 states have internal predecessors, (905), 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) [2023-08-29 20:31:13,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 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) [2023-08-29 20:31:13,930 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 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) [2023-08-29 20:31:13,930 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 245 flow. Second operand 7 states and 905 transitions. [2023-08-29 20:31:13,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 131 transitions, 897 flow [2023-08-29 20:31:14,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 131 transitions, 889 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-08-29 20:31:14,056 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 437 flow [2023-08-29 20:31:14,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=437, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2023-08-29 20:31:14,057 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 11 predicate places. [2023-08-29 20:31:14,057 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 437 flow [2023-08-29 20:31:14,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 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) [2023-08-29 20:31:14,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:14,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:14,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:31:14,058 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:14,058 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:14,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1189232109, now seen corresponding path program 1 times [2023-08-29 20:31:14,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:31:14,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869833009] [2023-08-29 20:31:14,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:14,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:31:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:14,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:14,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:31:14,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869833009] [2023-08-29 20:31:14,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869833009] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:14,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:14,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:31:14,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059693003] [2023-08-29 20:31:14,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:14,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:31:14,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:31:14,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:31:14,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:31:14,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 271 [2023-08-29 20:31:14,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 437 flow. Second operand has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 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) [2023-08-29 20:31:14,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:14,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 271 [2023-08-29 20:31:14,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:16,206 INFO L130 PetriNetUnfolder]: 15561/21747 cut-off events. [2023-08-29 20:31:16,206 INFO L131 PetriNetUnfolder]: For 84619/85593 co-relation queries the response was YES. [2023-08-29 20:31:16,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75217 conditions, 21747 events. 15561/21747 cut-off events. For 84619/85593 co-relation queries the response was YES. Maximal size of possible extension queue 830. Compared 122451 event pairs, 3919 based on Foata normal form. 1328/23036 useless extension candidates. Maximal degree in co-relation 75199. Up to 17555 conditions per place. [2023-08-29 20:31:16,342 INFO L137 encePairwiseOnDemand]: 266/271 looper letters, 57 selfloop transitions, 8 changer transitions 28/103 dead transitions. [2023-08-29 20:31:16,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 103 transitions, 928 flow [2023-08-29 20:31:16,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:31:16,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:31:16,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 663 transitions. [2023-08-29 20:31:16,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48929889298892987 [2023-08-29 20:31:16,345 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 663 transitions. [2023-08-29 20:31:16,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 663 transitions. [2023-08-29 20:31:16,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:16,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 663 transitions. [2023-08-29 20:31:16,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 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) [2023-08-29 20:31:16,349 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 271.0) internal successors, (1626), 6 states have internal predecessors, (1626), 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) [2023-08-29 20:31:16,350 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 271.0) internal successors, (1626), 6 states have internal predecessors, (1626), 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) [2023-08-29 20:31:16,350 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 437 flow. Second operand 5 states and 663 transitions. [2023-08-29 20:31:16,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 103 transitions, 928 flow [2023-08-29 20:31:16,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 103 transitions, 906 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-08-29 20:31:16,545 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 513 flow [2023-08-29 20:31:16,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=513, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2023-08-29 20:31:16,545 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 13 predicate places. [2023-08-29 20:31:16,546 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 513 flow [2023-08-29 20:31:16,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 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) [2023-08-29 20:31:16,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:16,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:16,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:31:16,547 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:16,547 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:16,547 INFO L85 PathProgramCache]: Analyzing trace with hash -122395513, now seen corresponding path program 1 times [2023-08-29 20:31:16,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:31:16,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687047858] [2023-08-29 20:31:16,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:16,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:31:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:16,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:16,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:31:16,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687047858] [2023-08-29 20:31:16,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687047858] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:16,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:16,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:31:16,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734986225] [2023-08-29 20:31:16,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:16,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:31:16,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:31:16,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:31:16,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:31:16,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 271 [2023-08-29 20:31:16,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 513 flow. Second operand has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 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) [2023-08-29 20:31:16,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:16,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 271 [2023-08-29 20:31:16,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:19,276 INFO L130 PetriNetUnfolder]: 23539/32383 cut-off events. [2023-08-29 20:31:19,276 INFO L131 PetriNetUnfolder]: For 132914/132914 co-relation queries the response was YES. [2023-08-29 20:31:19,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116961 conditions, 32383 events. 23539/32383 cut-off events. For 132914/132914 co-relation queries the response was YES. Maximal size of possible extension queue 1111. Compared 186829 event pairs, 4250 based on Foata normal form. 963/33346 useless extension candidates. Maximal degree in co-relation 116941. Up to 12330 conditions per place. [2023-08-29 20:31:19,483 INFO L137 encePairwiseOnDemand]: 261/271 looper letters, 70 selfloop transitions, 29 changer transitions 43/142 dead transitions. [2023-08-29 20:31:19,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 142 transitions, 1219 flow [2023-08-29 20:31:19,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:31:19,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:31:19,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 904 transitions. [2023-08-29 20:31:19,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4765419082762256 [2023-08-29 20:31:19,486 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 904 transitions. [2023-08-29 20:31:19,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 904 transitions. [2023-08-29 20:31:19,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:19,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 904 transitions. [2023-08-29 20:31:19,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.14285714285714) internal successors, (904), 7 states have internal predecessors, (904), 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) [2023-08-29 20:31:19,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 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) [2023-08-29 20:31:19,492 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 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) [2023-08-29 20:31:19,492 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 513 flow. Second operand 7 states and 904 transitions. [2023-08-29 20:31:19,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 142 transitions, 1219 flow [2023-08-29 20:31:19,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 142 transitions, 1189 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-08-29 20:31:19,635 INFO L231 Difference]: Finished difference. Result has 72 places, 64 transitions, 701 flow [2023-08-29 20:31:19,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=701, PETRI_PLACES=72, PETRI_TRANSITIONS=64} [2023-08-29 20:31:19,636 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 19 predicate places. [2023-08-29 20:31:19,636 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 64 transitions, 701 flow [2023-08-29 20:31:19,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 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) [2023-08-29 20:31:19,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:19,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:19,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:31:19,637 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:19,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:19,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1788467800, now seen corresponding path program 1 times [2023-08-29 20:31:19,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:31:19,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49794367] [2023-08-29 20:31:19,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:19,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:31:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:19,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:19,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:31:19,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49794367] [2023-08-29 20:31:19,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49794367] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:19,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:19,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:31:19,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777049447] [2023-08-29 20:31:19,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:19,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:31:19,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:31:19,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:31:19,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:31:19,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 271 [2023-08-29 20:31:19,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 64 transitions, 701 flow. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 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) [2023-08-29 20:31:19,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:19,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 271 [2023-08-29 20:31:19,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:22,059 INFO L130 PetriNetUnfolder]: 13280/19690 cut-off events. [2023-08-29 20:31:22,060 INFO L131 PetriNetUnfolder]: For 105786/107963 co-relation queries the response was YES. [2023-08-29 20:31:22,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70192 conditions, 19690 events. 13280/19690 cut-off events. For 105786/107963 co-relation queries the response was YES. Maximal size of possible extension queue 897. Compared 128126 event pairs, 2502 based on Foata normal form. 2094/21696 useless extension candidates. Maximal degree in co-relation 70170. Up to 13019 conditions per place. [2023-08-29 20:31:22,232 INFO L137 encePairwiseOnDemand]: 264/271 looper letters, 139 selfloop transitions, 10 changer transitions 0/167 dead transitions. [2023-08-29 20:31:22,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 167 transitions, 2034 flow [2023-08-29 20:31:22,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:31:22,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:31:22,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 663 transitions. [2023-08-29 20:31:22,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48929889298892987 [2023-08-29 20:31:22,235 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 663 transitions. [2023-08-29 20:31:22,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 663 transitions. [2023-08-29 20:31:22,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:22,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 663 transitions. [2023-08-29 20:31:22,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 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) [2023-08-29 20:31:22,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 271.0) internal successors, (1626), 6 states have internal predecessors, (1626), 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) [2023-08-29 20:31:22,240 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 271.0) internal successors, (1626), 6 states have internal predecessors, (1626), 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) [2023-08-29 20:31:22,240 INFO L175 Difference]: Start difference. First operand has 72 places, 64 transitions, 701 flow. Second operand 5 states and 663 transitions. [2023-08-29 20:31:22,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 167 transitions, 2034 flow [2023-08-29 20:31:22,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 167 transitions, 2020 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-29 20:31:22,311 INFO L231 Difference]: Finished difference. Result has 74 places, 73 transitions, 768 flow [2023-08-29 20:31:22,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=768, PETRI_PLACES=74, PETRI_TRANSITIONS=73} [2023-08-29 20:31:22,312 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 21 predicate places. [2023-08-29 20:31:22,312 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 73 transitions, 768 flow [2023-08-29 20:31:22,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 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) [2023-08-29 20:31:22,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:22,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:22,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:31:22,313 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:22,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:22,314 INFO L85 PathProgramCache]: Analyzing trace with hash -709388382, now seen corresponding path program 1 times [2023-08-29 20:31:22,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:31:22,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115626724] [2023-08-29 20:31:22,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:22,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:31:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:22,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:22,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:31:22,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115626724] [2023-08-29 20:31:22,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115626724] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:22,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:22,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:31:22,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948068353] [2023-08-29 20:31:22,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:22,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:31:22,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:31:22,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:31:22,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:31:22,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 271 [2023-08-29 20:31:22,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 73 transitions, 768 flow. Second operand has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 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) [2023-08-29 20:31:22,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:22,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 271 [2023-08-29 20:31:22,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:26,076 INFO L130 PetriNetUnfolder]: 24396/35246 cut-off events. [2023-08-29 20:31:26,076 INFO L131 PetriNetUnfolder]: For 196380/196380 co-relation queries the response was YES. [2023-08-29 20:31:26,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154685 conditions, 35246 events. 24396/35246 cut-off events. For 196380/196380 co-relation queries the response was YES. Maximal size of possible extension queue 1366. Compared 230257 event pairs, 3641 based on Foata normal form. 643/35889 useless extension candidates. Maximal degree in co-relation 154661. Up to 14749 conditions per place. [2023-08-29 20:31:26,349 INFO L137 encePairwiseOnDemand]: 261/271 looper letters, 82 selfloop transitions, 30 changer transitions 70/182 dead transitions. [2023-08-29 20:31:26,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 182 transitions, 1924 flow [2023-08-29 20:31:26,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:31:26,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:31:26,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 903 transitions. [2023-08-29 20:31:26,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47601476014760147 [2023-08-29 20:31:26,353 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 903 transitions. [2023-08-29 20:31:26,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 903 transitions. [2023-08-29 20:31:26,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:26,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 903 transitions. [2023-08-29 20:31:26,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 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) [2023-08-29 20:31:26,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 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) [2023-08-29 20:31:26,359 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 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) [2023-08-29 20:31:26,359 INFO L175 Difference]: Start difference. First operand has 74 places, 73 transitions, 768 flow. Second operand 7 states and 903 transitions. [2023-08-29 20:31:26,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 182 transitions, 1924 flow [2023-08-29 20:31:26,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 182 transitions, 1899 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-29 20:31:26,711 INFO L231 Difference]: Finished difference. Result has 85 places, 70 transitions, 907 flow [2023-08-29 20:31:26,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=907, PETRI_PLACES=85, PETRI_TRANSITIONS=70} [2023-08-29 20:31:26,712 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 32 predicate places. [2023-08-29 20:31:26,712 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 70 transitions, 907 flow [2023-08-29 20:31:26,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 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) [2023-08-29 20:31:26,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:26,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:26,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:31:26,713 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:26,713 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:26,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1933607194, now seen corresponding path program 1 times [2023-08-29 20:31:26,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:31:26,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938828920] [2023-08-29 20:31:26,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:26,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:31:26,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:26,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:31:26,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938828920] [2023-08-29 20:31:26,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938828920] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:26,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:26,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:31:26,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128062169] [2023-08-29 20:31:26,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:26,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:31:26,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:31:26,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:31:26,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:31:26,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 271 [2023-08-29 20:31:26,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 70 transitions, 907 flow. Second operand has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 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) [2023-08-29 20:31:26,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:26,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 271 [2023-08-29 20:31:26,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:31,129 INFO L130 PetriNetUnfolder]: 22190/33324 cut-off events. [2023-08-29 20:31:31,129 INFO L131 PetriNetUnfolder]: For 242752/243618 co-relation queries the response was YES. [2023-08-29 20:31:31,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143318 conditions, 33324 events. 22190/33324 cut-off events. For 242752/243618 co-relation queries the response was YES. Maximal size of possible extension queue 1571. Compared 235414 event pairs, 11670 based on Foata normal form. 1131/34134 useless extension candidates. Maximal degree in co-relation 143289. Up to 16576 conditions per place. [2023-08-29 20:31:31,343 INFO L137 encePairwiseOnDemand]: 267/271 looper letters, 73 selfloop transitions, 11 changer transitions 34/128 dead transitions. [2023-08-29 20:31:31,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 128 transitions, 1632 flow [2023-08-29 20:31:31,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:31:31,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:31:31,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 669 transitions. [2023-08-29 20:31:31,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49372693726937267 [2023-08-29 20:31:31,345 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 669 transitions. [2023-08-29 20:31:31,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 669 transitions. [2023-08-29 20:31:31,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:31,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 669 transitions. [2023-08-29 20:31:31,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 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) [2023-08-29 20:31:31,349 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 271.0) internal successors, (1626), 6 states have internal predecessors, (1626), 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) [2023-08-29 20:31:31,349 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 271.0) internal successors, (1626), 6 states have internal predecessors, (1626), 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) [2023-08-29 20:31:31,350 INFO L175 Difference]: Start difference. First operand has 85 places, 70 transitions, 907 flow. Second operand 5 states and 669 transitions. [2023-08-29 20:31:31,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 128 transitions, 1632 flow [2023-08-29 20:31:32,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 128 transitions, 1614 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-08-29 20:31:32,054 INFO L231 Difference]: Finished difference. Result has 85 places, 68 transitions, 906 flow [2023-08-29 20:31:32,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=906, PETRI_PLACES=85, PETRI_TRANSITIONS=68} [2023-08-29 20:31:32,055 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 32 predicate places. [2023-08-29 20:31:32,055 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 68 transitions, 906 flow [2023-08-29 20:31:32,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 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) [2023-08-29 20:31:32,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:32,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:32,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:31:32,056 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:32,056 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:32,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1676632659, now seen corresponding path program 1 times [2023-08-29 20:31:32,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:31:32,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615045767] [2023-08-29 20:31:32,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:32,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:31:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:32,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:32,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:31:32,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615045767] [2023-08-29 20:31:32,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615045767] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:32,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:32,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:31:32,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500214301] [2023-08-29 20:31:32,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:32,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:31:32,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:31:32,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:31:32,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:31:32,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 271 [2023-08-29 20:31:32,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 68 transitions, 906 flow. Second operand has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 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) [2023-08-29 20:31:32,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:32,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 271 [2023-08-29 20:31:32,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:34,597 INFO L130 PetriNetUnfolder]: 13640/21342 cut-off events. [2023-08-29 20:31:34,598 INFO L131 PetriNetUnfolder]: For 105705/106534 co-relation queries the response was YES. [2023-08-29 20:31:34,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83497 conditions, 21342 events. 13640/21342 cut-off events. For 105705/106534 co-relation queries the response was YES. Maximal size of possible extension queue 1143. Compared 154886 event pairs, 1935 based on Foata normal form. 2385/23437 useless extension candidates. Maximal degree in co-relation 83466. Up to 8775 conditions per place. [2023-08-29 20:31:34,719 INFO L137 encePairwiseOnDemand]: 264/271 looper letters, 149 selfloop transitions, 14 changer transitions 15/195 dead transitions. [2023-08-29 20:31:34,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 195 transitions, 2802 flow [2023-08-29 20:31:34,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:31:34,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:31:34,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 798 transitions. [2023-08-29 20:31:34,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4907749077490775 [2023-08-29 20:31:34,721 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 798 transitions. [2023-08-29 20:31:34,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 798 transitions. [2023-08-29 20:31:34,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:34,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 798 transitions. [2023-08-29 20:31:34,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.0) internal successors, (798), 6 states have internal predecessors, (798), 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) [2023-08-29 20:31:34,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 271.0) internal successors, (1897), 7 states have internal predecessors, (1897), 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) [2023-08-29 20:31:34,725 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 271.0) internal successors, (1897), 7 states have internal predecessors, (1897), 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) [2023-08-29 20:31:34,725 INFO L175 Difference]: Start difference. First operand has 85 places, 68 transitions, 906 flow. Second operand 6 states and 798 transitions. [2023-08-29 20:31:34,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 195 transitions, 2802 flow [2023-08-29 20:31:34,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 195 transitions, 2753 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-08-29 20:31:34,820 INFO L231 Difference]: Finished difference. Result has 87 places, 76 transitions, 981 flow [2023-08-29 20:31:34,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=881, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=981, PETRI_PLACES=87, PETRI_TRANSITIONS=76} [2023-08-29 20:31:34,821 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 34 predicate places. [2023-08-29 20:31:34,821 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 76 transitions, 981 flow [2023-08-29 20:31:34,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 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) [2023-08-29 20:31:34,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:34,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:34,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:31:34,822 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:34,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:34,823 INFO L85 PathProgramCache]: Analyzing trace with hash 70580508, now seen corresponding path program 1 times [2023-08-29 20:31:34,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:31:34,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037857907] [2023-08-29 20:31:34,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:34,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:31:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:35,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:35,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:31:35,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037857907] [2023-08-29 20:31:35,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037857907] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:35,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:35,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:31:35,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614140654] [2023-08-29 20:31:35,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:35,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:31:35,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:31:35,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:31:35,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:31:35,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 271 [2023-08-29 20:31:35,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 76 transitions, 981 flow. Second operand has 6 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 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) [2023-08-29 20:31:35,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:35,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 271 [2023-08-29 20:31:35,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:37,252 INFO L130 PetriNetUnfolder]: 10902/17227 cut-off events. [2023-08-29 20:31:37,252 INFO L131 PetriNetUnfolder]: For 88849/89475 co-relation queries the response was YES. [2023-08-29 20:31:37,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78686 conditions, 17227 events. 10902/17227 cut-off events. For 88849/89475 co-relation queries the response was YES. Maximal size of possible extension queue 983. Compared 124296 event pairs, 1240 based on Foata normal form. 1006/17967 useless extension candidates. Maximal degree in co-relation 78655. Up to 7398 conditions per place. [2023-08-29 20:31:37,314 INFO L137 encePairwiseOnDemand]: 264/271 looper letters, 115 selfloop transitions, 17 changer transitions 86/231 dead transitions. [2023-08-29 20:31:37,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 231 transitions, 3254 flow [2023-08-29 20:31:37,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:31:37,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:31:37,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1063 transitions. [2023-08-29 20:31:37,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49031365313653136 [2023-08-29 20:31:37,316 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1063 transitions. [2023-08-29 20:31:37,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1063 transitions. [2023-08-29 20:31:37,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:37,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1063 transitions. [2023-08-29 20:31:37,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 132.875) internal successors, (1063), 8 states have internal predecessors, (1063), 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) [2023-08-29 20:31:37,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 271.0) internal successors, (2439), 9 states have internal predecessors, (2439), 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) [2023-08-29 20:31:37,322 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 271.0) internal successors, (2439), 9 states have internal predecessors, (2439), 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) [2023-08-29 20:31:37,322 INFO L175 Difference]: Start difference. First operand has 87 places, 76 transitions, 981 flow. Second operand 8 states and 1063 transitions. [2023-08-29 20:31:37,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 231 transitions, 3254 flow [2023-08-29 20:31:38,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 231 transitions, 3196 flow, removed 24 selfloop flow, removed 4 redundant places. [2023-08-29 20:31:38,623 INFO L231 Difference]: Finished difference. Result has 93 places, 71 transitions, 881 flow [2023-08-29 20:31:38,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=923, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=881, PETRI_PLACES=93, PETRI_TRANSITIONS=71} [2023-08-29 20:31:38,624 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 40 predicate places. [2023-08-29 20:31:38,624 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 71 transitions, 881 flow [2023-08-29 20:31:38,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 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) [2023-08-29 20:31:38,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:38,625 INFO L208 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] [2023-08-29 20:31:38,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 20:31:38,625 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:38,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:38,625 INFO L85 PathProgramCache]: Analyzing trace with hash -505339978, now seen corresponding path program 1 times [2023-08-29 20:31:38,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:31:38,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102376928] [2023-08-29 20:31:38,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:38,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:31:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:38,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:38,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:31:38,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102376928] [2023-08-29 20:31:38,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102376928] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:38,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:38,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:31:38,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243244011] [2023-08-29 20:31:38,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:38,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:31:38,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:31:38,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:31:38,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:31:38,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 271 [2023-08-29 20:31:38,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 71 transitions, 881 flow. Second operand has 7 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 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) [2023-08-29 20:31:38,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:38,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 271 [2023-08-29 20:31:38,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:41,113 INFO L130 PetriNetUnfolder]: 7976/13080 cut-off events. [2023-08-29 20:31:41,113 INFO L131 PetriNetUnfolder]: For 72393/72868 co-relation queries the response was YES. [2023-08-29 20:31:41,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57618 conditions, 13080 events. 7976/13080 cut-off events. For 72393/72868 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 97917 event pairs, 1084 based on Foata normal form. 334/13178 useless extension candidates. Maximal degree in co-relation 57586. Up to 3340 conditions per place. [2023-08-29 20:31:41,174 INFO L137 encePairwiseOnDemand]: 264/271 looper letters, 53 selfloop transitions, 17 changer transitions 129/202 dead transitions. [2023-08-29 20:31:41,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 202 transitions, 2762 flow [2023-08-29 20:31:41,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 20:31:41,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 20:31:41,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1294 transitions. [2023-08-29 20:31:41,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4774907749077491 [2023-08-29 20:31:41,178 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1294 transitions. [2023-08-29 20:31:41,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1294 transitions. [2023-08-29 20:31:41,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:41,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1294 transitions. [2023-08-29 20:31:41,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 129.4) internal successors, (1294), 10 states have internal predecessors, (1294), 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) [2023-08-29 20:31:41,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 271.0) internal successors, (2981), 11 states have internal predecessors, (2981), 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) [2023-08-29 20:31:41,185 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 271.0) internal successors, (2981), 11 states have internal predecessors, (2981), 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) [2023-08-29 20:31:41,185 INFO L175 Difference]: Start difference. First operand has 93 places, 71 transitions, 881 flow. Second operand 10 states and 1294 transitions. [2023-08-29 20:31:41,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 202 transitions, 2762 flow [2023-08-29 20:31:42,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 202 transitions, 2574 flow, removed 45 selfloop flow, removed 11 redundant places. [2023-08-29 20:31:42,191 INFO L231 Difference]: Finished difference. Result has 93 places, 40 transitions, 355 flow [2023-08-29 20:31:42,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=355, PETRI_PLACES=93, PETRI_TRANSITIONS=40} [2023-08-29 20:31:42,191 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 40 predicate places. [2023-08-29 20:31:42,191 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 40 transitions, 355 flow [2023-08-29 20:31:42,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 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) [2023-08-29 20:31:42,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:42,192 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:42,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 20:31:42,192 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:42,193 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:42,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1869271504, now seen corresponding path program 1 times [2023-08-29 20:31:42,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:31:42,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326008872] [2023-08-29 20:31:42,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:42,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:31:42,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:43,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:43,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:31:43,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326008872] [2023-08-29 20:31:43,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326008872] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:43,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:43,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:31:43,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892511904] [2023-08-29 20:31:43,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:43,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:31:43,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:31:43,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:31:43,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:31:43,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 271 [2023-08-29 20:31:43,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 40 transitions, 355 flow. Second operand has 9 states, 9 states have (on average 120.77777777777777) internal successors, (1087), 9 states have internal predecessors, (1087), 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) [2023-08-29 20:31:43,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:43,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 271 [2023-08-29 20:31:43,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:43,575 INFO L130 PetriNetUnfolder]: 543/900 cut-off events. [2023-08-29 20:31:43,576 INFO L131 PetriNetUnfolder]: For 3371/3371 co-relation queries the response was YES. [2023-08-29 20:31:43,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3896 conditions, 900 events. 543/900 cut-off events. For 3371/3371 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3490 event pairs, 137 based on Foata normal form. 1/897 useless extension candidates. Maximal degree in co-relation 3867. Up to 513 conditions per place. [2023-08-29 20:31:43,581 INFO L137 encePairwiseOnDemand]: 264/271 looper letters, 51 selfloop transitions, 4 changer transitions 32/90 dead transitions. [2023-08-29 20:31:43,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 90 transitions, 893 flow [2023-08-29 20:31:43,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:31:43,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:31:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1002 transitions. [2023-08-29 20:31:43,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4621771217712177 [2023-08-29 20:31:43,584 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1002 transitions. [2023-08-29 20:31:43,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1002 transitions. [2023-08-29 20:31:43,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:43,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1002 transitions. [2023-08-29 20:31:43,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.25) internal successors, (1002), 8 states have internal predecessors, (1002), 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) [2023-08-29 20:31:43,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 271.0) internal successors, (2439), 9 states have internal predecessors, (2439), 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) [2023-08-29 20:31:43,591 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 271.0) internal successors, (2439), 9 states have internal predecessors, (2439), 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) [2023-08-29 20:31:43,591 INFO L175 Difference]: Start difference. First operand has 93 places, 40 transitions, 355 flow. Second operand 8 states and 1002 transitions. [2023-08-29 20:31:43,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 90 transitions, 893 flow [2023-08-29 20:31:43,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 90 transitions, 552 flow, removed 63 selfloop flow, removed 35 redundant places. [2023-08-29 20:31:43,600 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 177 flow [2023-08-29 20:31:43,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=177, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2023-08-29 20:31:43,601 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2023-08-29 20:31:43,601 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 177 flow [2023-08-29 20:31:43,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 120.77777777777777) internal successors, (1087), 9 states have internal predecessors, (1087), 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) [2023-08-29 20:31:43,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:43,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:43,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 20:31:43,608 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:43,608 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:43,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1448832362, now seen corresponding path program 2 times [2023-08-29 20:31:43,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:31:43,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087526165] [2023-08-29 20:31:43,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:43,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:31:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:31:43,706 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:31:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:31:43,815 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:31:43,816 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:31:43,818 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-29 20:31:43,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-29 20:31:43,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-29 20:31:43,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-29 20:31:43,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-29 20:31:43,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-29 20:31:43,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-29 20:31:43,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-29 20:31:43,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-29 20:31:43,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-29 20:31:43,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-29 20:31:43,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-29 20:31:43,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-29 20:31:43,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-29 20:31:43,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-29 20:31:43,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-29 20:31:43,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 20:31:43,827 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:43,832 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:31:43,832 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:31:43,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:31:43 BasicIcfg [2023-08-29 20:31:43,919 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:31:43,920 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:31:43,920 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:31:43,920 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:31:43,920 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:30:56" (3/4) ... [2023-08-29 20:31:43,922 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:31:43,923 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:31:43,923 INFO L158 Benchmark]: Toolchain (without parser) took 48899.46ms. Allocated memory was 62.9MB in the beginning and 8.8GB in the end (delta: 8.7GB). Free memory was 29.7MB in the beginning and 7.4GB in the end (delta: -7.4GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2023-08-29 20:31:43,924 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 46.1MB. Free memory was 24.5MB in the beginning and 24.4MB in the end (delta: 52.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:31:43,924 INFO L158 Benchmark]: CACSL2BoogieTranslator took 605.80ms. Allocated memory is still 62.9MB. Free memory was 29.5MB in the beginning and 35.3MB in the end (delta: -5.7MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2023-08-29 20:31:43,924 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.13ms. Allocated memory is still 62.9MB. Free memory was 35.3MB in the beginning and 32.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:31:43,924 INFO L158 Benchmark]: Boogie Preprocessor took 61.90ms. Allocated memory is still 62.9MB. Free memory was 32.7MB in the beginning and 30.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:31:43,925 INFO L158 Benchmark]: RCFGBuilder took 789.05ms. Allocated memory was 62.9MB in the beginning and 79.7MB in the end (delta: 16.8MB). Free memory was 30.6MB in the beginning and 45.3MB in the end (delta: -14.7MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2023-08-29 20:31:43,925 INFO L158 Benchmark]: TraceAbstraction took 47351.42ms. Allocated memory was 79.7MB in the beginning and 8.8GB in the end (delta: 8.7GB). Free memory was 44.3MB in the beginning and 7.4GB in the end (delta: -7.3GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2023-08-29 20:31:43,925 INFO L158 Benchmark]: Witness Printer took 3.07ms. Allocated memory is still 8.8GB. Free memory is still 7.4GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:31:43,927 INFO L339 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 46.1MB. Free memory was 24.5MB in the beginning and 24.4MB in the end (delta: 52.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 605.80ms. Allocated memory is still 62.9MB. Free memory was 29.5MB in the beginning and 35.3MB in the end (delta: -5.7MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.13ms. Allocated memory is still 62.9MB. Free memory was 35.3MB in the beginning and 32.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.90ms. Allocated memory is still 62.9MB. Free memory was 32.7MB in the beginning and 30.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 789.05ms. Allocated memory was 62.9MB in the beginning and 79.7MB in the end (delta: 16.8MB). Free memory was 30.6MB in the beginning and 45.3MB in the end (delta: -14.7MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * TraceAbstraction took 47351.42ms. Allocated memory was 79.7MB in the beginning and 8.8GB in the end (delta: 8.7GB). Free memory was 44.3MB in the beginning and 7.4GB in the end (delta: -7.3GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 3.07ms. Allocated memory is still 8.8GB. Free memory is still 7.4GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 146 PlacesBefore, 53 PlacesAfterwards, 135 TransitionsBefore, 41 TransitionsAfterwards, 3412 CoEnabledTransitionPairs, 6 FixpointIterations, 53 TrivialSequentialCompositions, 70 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 132 TotalNumberOfCompositions, 9326 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3955, independent: 3748, independent conditional: 0, independent unconditional: 3748, dependent: 207, dependent conditional: 0, dependent unconditional: 207, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1734, independent: 1689, independent conditional: 0, independent unconditional: 1689, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3955, independent: 2059, independent conditional: 0, independent unconditional: 2059, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 1734, unknown conditional: 0, unknown unconditional: 1734] , Statistics on independence cache: Total cache size (in pairs): 196, Positive cache size: 172, Positive conditional cache size: 0, Positive unconditional cache size: 172, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool a$flush_delayed; [L716] 0 int a$mem_tmp; [L717] 0 _Bool a$r_buff0_thd0; [L718] 0 _Bool a$r_buff0_thd1; [L719] 0 _Bool a$r_buff0_thd2; [L720] 0 _Bool a$r_buff0_thd3; [L721] 0 _Bool a$r_buff0_thd4; [L722] 0 _Bool a$r_buff1_thd0; [L723] 0 _Bool a$r_buff1_thd1; [L724] 0 _Bool a$r_buff1_thd2; [L725] 0 _Bool a$r_buff1_thd3; [L726] 0 _Bool a$r_buff1_thd4; [L727] 0 _Bool a$read_delayed; [L728] 0 int *a$read_delayed_var; [L729] 0 int a$w_buff0; [L730] 0 _Bool a$w_buff0_used; [L731] 0 int a$w_buff1; [L732] 0 _Bool a$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L857] 0 pthread_t t1513; [L858] FCALL, FORK 0 pthread_create(&t1513, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1513, ((void *)0), P0, ((void *)0))=-2, t1513={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L859] 0 pthread_t t1514; [L860] FCALL, FORK 0 pthread_create(&t1514, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1514, ((void *)0), P1, ((void *)0))=-1, t1513={5:0}, t1514={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t1515; [L862] FCALL, FORK 0 pthread_create(&t1515, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1515, ((void *)0), P2, ((void *)0))=0, t1513={5:0}, t1514={6:0}, t1515={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1516; [L864] FCALL, FORK 0 pthread_create(&t1516, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1516, ((void *)0), P3, ((void *)0))=1, t1513={5:0}, t1514={6:0}, t1515={7:0}, t1516={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L746] 1 a$w_buff1 = a$w_buff0 [L747] 1 a$w_buff0 = 1 [L748] 1 a$w_buff1_used = a$w_buff0_used [L749] 1 a$w_buff0_used = (_Bool)1 [L750] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L750] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L751] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L752] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L753] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L754] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L755] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L779] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L796] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L802] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L803] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L804] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L805] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L806] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L816] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L819] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L820] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L821] 4 a$flush_delayed = weak$$choice2 [L822] 4 a$mem_tmp = a [L823] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L824] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L825] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L826] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L827] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L828] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L829] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 __unbuffered_p3_EAX = a [L831] 4 a = a$flush_delayed ? a$mem_tmp : a [L832] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] [L835] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L836] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L837] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L838] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L839] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L809] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L811] 3 return 0; [L842] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L844] 4 return 0; [L866] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L868] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L868] RET 0 assume_abort_if_not(main$tmp_guard0) [L870] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L871] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L872] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L873] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L874] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1513={5:0}, t1514={6:0}, t1515={7:0}, t1516={3:0}, weak$$choice2=0, x=2, y=2, z=2] [L877] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 175 locations, 16 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: 47.2s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 38.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1146 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 967 mSDsluCounter, 469 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 363 mSDsCounter, 119 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2590 IncrementalHoareTripleChecker+Invalid, 2709 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 119 mSolverCounterUnsat, 106 mSDtfsCounter, 2590 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=981occurred in iteration=12, InterpolantAutomatonStates: 91, 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.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 209 ConstructedInterpolants, 0 QuantifiedInterpolants, 1495 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 [2023-08-29 20:31:43,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 649d1c1aa65cb6010503451d39379fb2c9cafcc7e0f5f23661f58b5d14c46288 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:31:46,388 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:31:46,389 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:31:46,425 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:31:46,425 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:31:46,428 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:31:46,431 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:31:46,434 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:31:46,436 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:31:46,440 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:31:46,441 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:31:46,443 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:31:46,443 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:31:46,445 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:31:46,448 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:31:46,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:31:46,454 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:31:46,455 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:31:46,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:31:46,460 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:31:46,469 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:31:46,471 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:31:46,472 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:31:46,473 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:31:46,479 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:31:46,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:31:46,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:31:46,482 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:31:46,483 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:31:46,484 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:31:46,485 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:31:46,486 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:31:46,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:31:46,488 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:31:46,488 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:31:46,489 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:31:46,489 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:31:46,489 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:31:46,490 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:31:46,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:31:46,491 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:31:46,493 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-29 20:31:46,528 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:31:46,528 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:31:46,529 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:31:46,529 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:31:46,530 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:31:46,530 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:31:46,531 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:31:46,531 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:31:46,531 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:31:46,532 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:31:46,532 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:31:46,532 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:31:46,533 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:31:46,533 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:31:46,533 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:31:46,533 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:31:46,533 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:31:46,534 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:31:46,534 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:31:46,534 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:31:46,534 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:31:46,534 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:31:46,535 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:31:46,535 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:31:46,535 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:31:46,535 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:31:46,535 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:31:46,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:31:46,536 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:31:46,536 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:31:46,536 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:31:46,536 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:31:46,537 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:31:46,537 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:31:46,537 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:31:46,537 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:31:46,537 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:31:46,538 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 649d1c1aa65cb6010503451d39379fb2c9cafcc7e0f5f23661f58b5d14c46288 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 20:31:46,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:31:46,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:31:46,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:31:46,845 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:31:46,846 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:31:46,847 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:31:48,073 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:31:48,341 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:31:48,342 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:31:48,357 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36be535bb/88ddce5fcada4ed5bf02d667416ec908/FLAG3728296e8 [2023-08-29 20:31:48,371 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36be535bb/88ddce5fcada4ed5bf02d667416ec908 [2023-08-29 20:31:48,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:31:48,375 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:31:48,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:31:48,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:31:48,379 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:31:48,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:31:48" (1/1) ... [2023-08-29 20:31:48,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@552b11b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:48, skipping insertion in model container [2023-08-29 20:31:48,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:31:48" (1/1) ... [2023-08-29 20:31:48,386 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:31:48,443 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:31:48,615 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-29 20:31:48,814 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:31:48,827 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:31:48,839 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-29 20:31:48,914 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:31:48,941 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:31:48,941 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:31:48,947 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:31:48,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:48 WrapperNode [2023-08-29 20:31:48,948 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:31:48,949 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:31:48,949 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:31:48,949 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:31:48,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:48" (1/1) ... [2023-08-29 20:31:48,976 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:48" (1/1) ... [2023-08-29 20:31:48,995 INFO L138 Inliner]: procedures = 180, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-08-29 20:31:48,996 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:31:48,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:31:48,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:31:48,997 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:31:49,004 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:48" (1/1) ... [2023-08-29 20:31:49,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:48" (1/1) ... [2023-08-29 20:31:49,008 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:48" (1/1) ... [2023-08-29 20:31:49,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:48" (1/1) ... [2023-08-29 20:31:49,018 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:48" (1/1) ... [2023-08-29 20:31:49,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:48" (1/1) ... [2023-08-29 20:31:49,022 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:48" (1/1) ... [2023-08-29 20:31:49,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:48" (1/1) ... [2023-08-29 20:31:49,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:31:49,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:31:49,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:31:49,028 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:31:49,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:48" (1/1) ... [2023-08-29 20:31:49,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:31:49,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:31:49,057 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 20:31:49,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 20:31:49,087 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:31:49,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:31:49,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:31:49,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:31:49,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:31:49,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:31:49,088 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:31:49,088 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:31:49,088 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:31:49,088 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:31:49,089 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:31:49,089 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:31:49,089 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-29 20:31:49,089 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-29 20:31:49,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:31:49,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:31:49,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:31:49,091 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:31:49,232 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:31:49,234 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:31:49,753 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:31:49,897 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:31:49,897 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:31:49,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:31:49 BoogieIcfgContainer [2023-08-29 20:31:49,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:31:49,902 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:31:49,902 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:31:49,905 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:31:49,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:31:48" (1/3) ... [2023-08-29 20:31:49,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c125681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:31:49, skipping insertion in model container [2023-08-29 20:31:49,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:48" (2/3) ... [2023-08-29 20:31:49,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c125681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:31:49, skipping insertion in model container [2023-08-29 20:31:49,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:31:49" (3/3) ... [2023-08-29 20:31:49,908 INFO L112 eAbstractionObserver]: Analyzing ICFG mix057_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:31:49,923 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:31:49,923 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-29 20:31:49,925 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:31:49,999 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:31:50,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 300 flow [2023-08-29 20:31:50,107 INFO L130 PetriNetUnfolder]: 2/136 cut-off events. [2023-08-29 20:31:50,107 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:31:50,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 2/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-29 20:31:50,112 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 140 transitions, 300 flow [2023-08-29 20:31:50,121 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 136 transitions, 284 flow [2023-08-29 20:31:50,124 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:31:50,134 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 136 transitions, 284 flow [2023-08-29 20:31:50,136 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 136 transitions, 284 flow [2023-08-29 20:31:50,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 284 flow [2023-08-29 20:31:50,174 INFO L130 PetriNetUnfolder]: 2/136 cut-off events. [2023-08-29 20:31:50,174 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:31:50,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 2/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-29 20:31:50,177 INFO L119 LiptonReduction]: Number of co-enabled transitions 3412 [2023-08-29 20:31:56,796 INFO L134 LiptonReduction]: Checked pairs total: 10014 [2023-08-29 20:31:56,796 INFO L136 LiptonReduction]: Total number of compositions: 131 [2023-08-29 20:31:56,808 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:31:56,814 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@68a0dbda, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:31:56,814 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-29 20:31:56,816 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 20:31:56,816 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:31:56,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:56,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:31:56,817 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:56,821 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:56,822 INFO L85 PathProgramCache]: Analyzing trace with hash 595, now seen corresponding path program 1 times [2023-08-29 20:31:56,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:56,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [670991984] [2023-08-29 20:31:56,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:56,840 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 [2023-08-29 20:31:56,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:56,841 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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) [2023-08-29 20:31:56,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 [2023-08-29 20:31:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:56,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:31:56,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:31:56,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:56,910 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:31:56,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:31:56,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [670991984] [2023-08-29 20:31:56,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [670991984] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:56,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:56,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:31:56,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531611443] [2023-08-29 20:31:56,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:56,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:31:56,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:31:56,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:31:56,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:31:56,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 271 [2023-08-29 20:31:56,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 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) [2023-08-29 20:31:56,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:56,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 271 [2023-08-29 20:31:56,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:58,561 INFO L130 PetriNetUnfolder]: 9959/13410 cut-off events. [2023-08-29 20:31:58,562 INFO L131 PetriNetUnfolder]: For 85/85 co-relation queries the response was YES. [2023-08-29 20:31:58,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26998 conditions, 13410 events. 9959/13410 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 596. Compared 68784 event pairs, 9959 based on Foata normal form. 400/11908 useless extension candidates. Maximal degree in co-relation 26986. Up to 13371 conditions per place. [2023-08-29 20:31:58,654 INFO L137 encePairwiseOnDemand]: 262/271 looper letters, 29 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-08-29 20:31:58,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 134 flow [2023-08-29 20:31:58,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:31:58,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:31:58,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 288 transitions. [2023-08-29 20:31:58,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5313653136531366 [2023-08-29 20:31:58,667 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 288 transitions. [2023-08-29 20:31:58,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 288 transitions. [2023-08-29 20:31:58,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:58,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 288 transitions. [2023-08-29 20:31:58,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 144.0) internal successors, (288), 2 states have internal predecessors, (288), 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) [2023-08-29 20:31:58,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 271.0) internal successors, (813), 3 states have internal predecessors, (813), 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) [2023-08-29 20:31:58,689 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 271.0) internal successors, (813), 3 states have internal predecessors, (813), 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) [2023-08-29 20:31:58,692 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 288 transitions. [2023-08-29 20:31:58,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 134 flow [2023-08-29 20:31:58,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:31:58,703 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-08-29 20:31:58,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-08-29 20:31:58,710 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-08-29 20:31:58,711 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-08-29 20:31:58,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 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) [2023-08-29 20:31:58,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:58,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:31:58,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2023-08-29 20:31:58,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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 [2023-08-29 20:31:58,925 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:58,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:58,925 INFO L85 PathProgramCache]: Analyzing trace with hash 587500, now seen corresponding path program 1 times [2023-08-29 20:31:58,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:58,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24472664] [2023-08-29 20:31:58,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:58,927 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 [2023-08-29 20:31:58,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:58,929 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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) [2023-08-29 20:31:58,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 [2023-08-29 20:31:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:59,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:31:59,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:31:59,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:59,026 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:31:59,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:31:59,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24472664] [2023-08-29 20:31:59,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24472664] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:59,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:59,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:31:59,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802517406] [2023-08-29 20:31:59,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:59,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:31:59,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:31:59,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:31:59,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:31:59,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 271 [2023-08-29 20:31:59,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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) [2023-08-29 20:31:59,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:59,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 271 [2023-08-29 20:31:59,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:00,216 INFO L130 PetriNetUnfolder]: 7831/11250 cut-off events. [2023-08-29 20:32:00,218 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:32:00,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21983 conditions, 11250 events. 7831/11250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 68499 event pairs, 1447 based on Foata normal form. 0/10286 useless extension candidates. Maximal degree in co-relation 21980. Up to 8431 conditions per place. [2023-08-29 20:32:00,301 INFO L137 encePairwiseOnDemand]: 268/271 looper letters, 45 selfloop transitions, 2 changer transitions 4/54 dead transitions. [2023-08-29 20:32:00,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 54 transitions, 224 flow [2023-08-29 20:32:00,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:32:00,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:32:00,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2023-08-29 20:32:00,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5215252152521526 [2023-08-29 20:32:00,305 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2023-08-29 20:32:00,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2023-08-29 20:32:00,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:00,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2023-08-29 20:32:00,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 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) [2023-08-29 20:32:00,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 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) [2023-08-29 20:32:00,310 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 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) [2023-08-29 20:32:00,310 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 424 transitions. [2023-08-29 20:32:00,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 54 transitions, 224 flow [2023-08-29 20:32:00,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 224 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:32:00,312 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 70 flow [2023-08-29 20:32:00,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, 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=70, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2023-08-29 20:32:00,313 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-08-29 20:32:00,313 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 70 flow [2023-08-29 20:32:00,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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) [2023-08-29 20:32:00,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:00,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:32:00,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2023-08-29 20:32:00,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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 [2023-08-29 20:32:00,524 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:32:00,525 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:00,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1287768771, now seen corresponding path program 1 times [2023-08-29 20:32:00,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:32:00,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743339679] [2023-08-29 20:32:00,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:00,529 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 [2023-08-29 20:32:00,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:32:00,530 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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) [2023-08-29 20:32:00,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 [2023-08-29 20:32:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:00,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:32:00,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:32:00,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:32:00,668 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:32:00,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:32:00,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [743339679] [2023-08-29 20:32:00,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [743339679] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:00,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:00,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:32:00,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511342019] [2023-08-29 20:32:00,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:00,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:32:00,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:32:00,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:32:00,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:32:00,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 271 [2023-08-29 20:32:00,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 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) [2023-08-29 20:32:00,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:00,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 271 [2023-08-29 20:32:00,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:01,463 INFO L130 PetriNetUnfolder]: 4483/6377 cut-off events. [2023-08-29 20:32:01,464 INFO L131 PetriNetUnfolder]: For 421/421 co-relation queries the response was YES. [2023-08-29 20:32:01,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13326 conditions, 6377 events. 4483/6377 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 33520 event pairs, 818 based on Foata normal form. 320/6472 useless extension candidates. Maximal degree in co-relation 13322. Up to 4756 conditions per place. [2023-08-29 20:32:01,511 INFO L137 encePairwiseOnDemand]: 264/271 looper letters, 40 selfloop transitions, 5 changer transitions 27/75 dead transitions. [2023-08-29 20:32:01,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 75 transitions, 318 flow [2023-08-29 20:32:01,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:32:01,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:32:01,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 669 transitions. [2023-08-29 20:32:01,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49372693726937267 [2023-08-29 20:32:01,515 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 669 transitions. [2023-08-29 20:32:01,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 669 transitions. [2023-08-29 20:32:01,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:01,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 669 transitions. [2023-08-29 20:32:01,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 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) [2023-08-29 20:32:01,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 271.0) internal successors, (1626), 6 states have internal predecessors, (1626), 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) [2023-08-29 20:32:01,522 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 271.0) internal successors, (1626), 6 states have internal predecessors, (1626), 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) [2023-08-29 20:32:01,523 INFO L175 Difference]: Start difference. First operand has 43 places, 29 transitions, 70 flow. Second operand 5 states and 669 transitions. [2023-08-29 20:32:01,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 75 transitions, 318 flow [2023-08-29 20:32:01,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 75 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:32:01,526 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 111 flow [2023-08-29 20:32:01,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2023-08-29 20:32:01,527 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -7 predicate places. [2023-08-29 20:32:01,527 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 111 flow [2023-08-29 20:32:01,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 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) [2023-08-29 20:32:01,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:01,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:32:01,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2023-08-29 20:32:01,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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 [2023-08-29 20:32:01,748 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:32:01,749 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:01,749 INFO L85 PathProgramCache]: Analyzing trace with hash -991528504, now seen corresponding path program 1 times [2023-08-29 20:32:01,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:32:01,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2019676454] [2023-08-29 20:32:01,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:01,750 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 [2023-08-29 20:32:01,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:32:01,753 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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) [2023-08-29 20:32:01,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 [2023-08-29 20:32:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:01,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:32:01,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:32:01,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:32:01,923 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:32:01,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:32:01,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2019676454] [2023-08-29 20:32:01,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2019676454] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:01,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:01,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:32:01,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962019136] [2023-08-29 20:32:01,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:01,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:32:01,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:32:01,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:32:01,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:32:01,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 271 [2023-08-29 20:32:01,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 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) [2023-08-29 20:32:01,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:01,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 271 [2023-08-29 20:32:01,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:02,585 INFO L130 PetriNetUnfolder]: 2161/3273 cut-off events. [2023-08-29 20:32:02,586 INFO L131 PetriNetUnfolder]: For 1187/1187 co-relation queries the response was YES. [2023-08-29 20:32:02,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8668 conditions, 3273 events. 2161/3273 cut-off events. For 1187/1187 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 16684 event pairs, 403 based on Foata normal form. 212/3395 useless extension candidates. Maximal degree in co-relation 8661. Up to 1426 conditions per place. [2023-08-29 20:32:02,602 INFO L137 encePairwiseOnDemand]: 264/271 looper letters, 53 selfloop transitions, 9 changer transitions 27/92 dead transitions. [2023-08-29 20:32:02,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 92 transitions, 467 flow [2023-08-29 20:32:02,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:32:02,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:32:02,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 805 transitions. [2023-08-29 20:32:02,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.495079950799508 [2023-08-29 20:32:02,605 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 805 transitions. [2023-08-29 20:32:02,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 805 transitions. [2023-08-29 20:32:02,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:02,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 805 transitions. [2023-08-29 20:32:02,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.16666666666666) internal successors, (805), 6 states have internal predecessors, (805), 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) [2023-08-29 20:32:02,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 271.0) internal successors, (1897), 7 states have internal predecessors, (1897), 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) [2023-08-29 20:32:02,612 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 271.0) internal successors, (1897), 7 states have internal predecessors, (1897), 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) [2023-08-29 20:32:02,612 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 111 flow. Second operand 6 states and 805 transitions. [2023-08-29 20:32:02,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 92 transitions, 467 flow [2023-08-29 20:32:02,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 92 transitions, 460 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:32:02,627 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 176 flow [2023-08-29 20:32:02,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2023-08-29 20:32:02,629 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2023-08-29 20:32:02,629 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 176 flow [2023-08-29 20:32:02,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 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) [2023-08-29 20:32:02,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:02,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:32:02,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 [2023-08-29 20:32:02,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/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 [2023-08-29 20:32:02,840 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:32:02,840 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:02,840 INFO L85 PathProgramCache]: Analyzing trace with hash -120552169, now seen corresponding path program 1 times [2023-08-29 20:32:02,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:32:02,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276432955] [2023-08-29 20:32:02,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:02,841 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 [2023-08-29 20:32:02,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:32:02,842 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/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) [2023-08-29 20:32:02,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 [2023-08-29 20:32:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:02,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:32:02,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:32:03,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:32:03,013 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:32:03,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:32:03,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276432955] [2023-08-29 20:32:03,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276432955] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:03,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:03,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:32:03,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299114095] [2023-08-29 20:32:03,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:03,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:32:03,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:32:03,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:32:03,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:32:03,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 271 [2023-08-29 20:32:03,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 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) [2023-08-29 20:32:03,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:03,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 271 [2023-08-29 20:32:03,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:03,498 INFO L130 PetriNetUnfolder]: 1189/1851 cut-off events. [2023-08-29 20:32:03,498 INFO L131 PetriNetUnfolder]: For 1774/1774 co-relation queries the response was YES. [2023-08-29 20:32:03,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5571 conditions, 1851 events. 1189/1851 cut-off events. For 1774/1774 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8834 event pairs, 331 based on Foata normal form. 77/1901 useless extension candidates. Maximal degree in co-relation 5562. Up to 630 conditions per place. [2023-08-29 20:32:03,509 INFO L137 encePairwiseOnDemand]: 264/271 looper letters, 64 selfloop transitions, 13 changer transitions 27/107 dead transitions. [2023-08-29 20:32:03,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 107 transitions, 636 flow [2023-08-29 20:32:03,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:32:03,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:32:03,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 939 transitions. [2023-08-29 20:32:03,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49499209277807066 [2023-08-29 20:32:03,516 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 939 transitions. [2023-08-29 20:32:03,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 939 transitions. [2023-08-29 20:32:03,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:03,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 939 transitions. [2023-08-29 20:32:03,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.14285714285714) internal successors, (939), 7 states have internal predecessors, (939), 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) [2023-08-29 20:32:03,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 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) [2023-08-29 20:32:03,524 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 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) [2023-08-29 20:32:03,524 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 176 flow. Second operand 7 states and 939 transitions. [2023-08-29 20:32:03,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 107 transitions, 636 flow [2023-08-29 20:32:03,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 107 transitions, 574 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-29 20:32:03,542 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 226 flow [2023-08-29 20:32:03,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=226, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2023-08-29 20:32:03,544 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2023-08-29 20:32:03,545 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 226 flow [2023-08-29 20:32:03,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 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) [2023-08-29 20:32:03,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:03,548 INFO L208 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] [2023-08-29 20:32:03,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-29 20:32:03,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/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 [2023-08-29 20:32:03,758 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:32:03,759 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:03,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1537306174, now seen corresponding path program 1 times [2023-08-29 20:32:03,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:32:03,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [903666506] [2023-08-29 20:32:03,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:03,759 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 [2023-08-29 20:32:03,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:32:03,761 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/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) [2023-08-29 20:32:03,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 [2023-08-29 20:32:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:03,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-29 20:32:03,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:32:03,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:32:03,937 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:32:03,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:32:03,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [903666506] [2023-08-29 20:32:03,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [903666506] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:03,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:03,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:32:03,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633820037] [2023-08-29 20:32:03,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:03,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:32:03,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:32:03,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:32:03,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:32:03,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 271 [2023-08-29 20:32:03,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 226 flow. Second operand has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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) [2023-08-29 20:32:03,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:03,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 271 [2023-08-29 20:32:03,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:04,436 INFO L130 PetriNetUnfolder]: 1011/1545 cut-off events. [2023-08-29 20:32:04,436 INFO L131 PetriNetUnfolder]: For 1419/1419 co-relation queries the response was YES. [2023-08-29 20:32:04,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4497 conditions, 1545 events. 1011/1545 cut-off events. For 1419/1419 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7152 event pairs, 326 based on Foata normal form. 14/1545 useless extension candidates. Maximal degree in co-relation 4487. Up to 630 conditions per place. [2023-08-29 20:32:04,449 INFO L137 encePairwiseOnDemand]: 264/271 looper letters, 60 selfloop transitions, 17 changer transitions 14/94 dead transitions. [2023-08-29 20:32:04,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 94 transitions, 572 flow [2023-08-29 20:32:04,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:32:04,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:32:04,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1045 transitions. [2023-08-29 20:32:04,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4820110701107011 [2023-08-29 20:32:04,456 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1045 transitions. [2023-08-29 20:32:04,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1045 transitions. [2023-08-29 20:32:04,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:04,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1045 transitions. [2023-08-29 20:32:04,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 130.625) internal successors, (1045), 8 states have internal predecessors, (1045), 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) [2023-08-29 20:32:04,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 271.0) internal successors, (2439), 9 states have internal predecessors, (2439), 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) [2023-08-29 20:32:04,463 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 271.0) internal successors, (2439), 9 states have internal predecessors, (2439), 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) [2023-08-29 20:32:04,463 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 226 flow. Second operand 8 states and 1045 transitions. [2023-08-29 20:32:04,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 94 transitions, 572 flow [2023-08-29 20:32:04,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 94 transitions, 510 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-29 20:32:04,481 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 220 flow [2023-08-29 20:32:04,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=220, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2023-08-29 20:32:04,482 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2023-08-29 20:32:04,482 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 220 flow [2023-08-29 20:32:04,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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) [2023-08-29 20:32:04,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:04,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:32:04,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 [2023-08-29 20:32:04,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/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 [2023-08-29 20:32:04,692 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:32:04,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:04,693 INFO L85 PathProgramCache]: Analyzing trace with hash 885607524, now seen corresponding path program 1 times [2023-08-29 20:32:04,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:32:04,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210404965] [2023-08-29 20:32:04,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:04,694 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 [2023-08-29 20:32:04,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:32:04,694 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/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) [2023-08-29 20:32:04,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 [2023-08-29 20:32:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:04,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-29 20:32:04,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:32:05,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:32:05,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:32:05,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:32:05,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [210404965] [2023-08-29 20:32:05,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [210404965] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:05,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:05,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:32:05,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154180457] [2023-08-29 20:32:05,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:05,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:32:05,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:32:05,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:32:05,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:32:05,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 271 [2023-08-29 20:32:05,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 220 flow. Second operand has 9 states, 9 states have (on average 118.77777777777777) internal successors, (1069), 9 states have internal predecessors, (1069), 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) [2023-08-29 20:32:05,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:05,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 271 [2023-08-29 20:32:05,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:05,877 INFO L130 PetriNetUnfolder]: 1159/1795 cut-off events. [2023-08-29 20:32:05,877 INFO L131 PetriNetUnfolder]: For 1938/1938 co-relation queries the response was YES. [2023-08-29 20:32:05,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5335 conditions, 1795 events. 1159/1795 cut-off events. For 1938/1938 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8568 event pairs, 166 based on Foata normal form. 0/1790 useless extension candidates. Maximal degree in co-relation 5324. Up to 773 conditions per place. [2023-08-29 20:32:05,888 INFO L137 encePairwiseOnDemand]: 264/271 looper letters, 100 selfloop transitions, 7 changer transitions 0/110 dead transitions. [2023-08-29 20:32:05,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 110 transitions, 812 flow [2023-08-29 20:32:05,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:32:05,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:32:05,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1000 transitions. [2023-08-29 20:32:05,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4612546125461255 [2023-08-29 20:32:05,892 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1000 transitions. [2023-08-29 20:32:05,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1000 transitions. [2023-08-29 20:32:05,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:05,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1000 transitions. [2023-08-29 20:32:05,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 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) [2023-08-29 20:32:05,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 271.0) internal successors, (2439), 9 states have internal predecessors, (2439), 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) [2023-08-29 20:32:05,899 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 271.0) internal successors, (2439), 9 states have internal predecessors, (2439), 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) [2023-08-29 20:32:05,899 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 220 flow. Second operand 8 states and 1000 transitions. [2023-08-29 20:32:05,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 110 transitions, 812 flow [2023-08-29 20:32:05,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 110 transitions, 656 flow, removed 38 selfloop flow, removed 7 redundant places. [2023-08-29 20:32:05,914 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 188 flow [2023-08-29 20:32:05,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=188, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2023-08-29 20:32:05,915 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 4 predicate places. [2023-08-29 20:32:05,915 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 188 flow [2023-08-29 20:32:05,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 118.77777777777777) internal successors, (1069), 9 states have internal predecessors, (1069), 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) [2023-08-29 20:32:05,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:05,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:32:05,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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 [2023-08-29 20:32:06,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/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 [2023-08-29 20:32:06,125 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:32:06,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:06,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1062596612, now seen corresponding path program 2 times [2023-08-29 20:32:06,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:32:06,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [310995956] [2023-08-29 20:32:06,126 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:32:06,126 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 [2023-08-29 20:32:06,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:32:06,127 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/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) [2023-08-29 20:32:06,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-29 20:32:06,245 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:32:06,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:32:06,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:32:06,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:32:06,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:32:06,283 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:32:06,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:32:06,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [310995956] [2023-08-29 20:32:06,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [310995956] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:06,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:06,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:32:06,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991728869] [2023-08-29 20:32:06,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:06,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:32:06,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:32:06,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:32:06,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:32:06,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 271 [2023-08-29 20:32:06,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 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) [2023-08-29 20:32:06,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:06,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 271 [2023-08-29 20:32:06,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:06,639 INFO L130 PetriNetUnfolder]: 1951/2960 cut-off events. [2023-08-29 20:32:06,639 INFO L131 PetriNetUnfolder]: For 2677/2677 co-relation queries the response was YES. [2023-08-29 20:32:06,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8637 conditions, 2960 events. 1951/2960 cut-off events. For 2677/2677 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 15202 event pairs, 767 based on Foata normal form. 1/2955 useless extension candidates. Maximal degree in co-relation 8626. Up to 1656 conditions per place. [2023-08-29 20:32:06,658 INFO L137 encePairwiseOnDemand]: 267/271 looper letters, 71 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2023-08-29 20:32:06,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 77 transitions, 492 flow [2023-08-29 20:32:06,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:32:06,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:32:06,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 522 transitions. [2023-08-29 20:32:06,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48154981549815495 [2023-08-29 20:32:06,661 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 522 transitions. [2023-08-29 20:32:06,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 522 transitions. [2023-08-29 20:32:06,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:06,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 522 transitions. [2023-08-29 20:32:06,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 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) [2023-08-29 20:32:06,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 271.0) internal successors, (1355), 5 states have internal predecessors, (1355), 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) [2023-08-29 20:32:06,665 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 271.0) internal successors, (1355), 5 states have internal predecessors, (1355), 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) [2023-08-29 20:32:06,665 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 188 flow. Second operand 4 states and 522 transitions. [2023-08-29 20:32:06,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 77 transitions, 492 flow [2023-08-29 20:32:06,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 77 transitions, 482 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:32:06,689 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 216 flow [2023-08-29 20:32:06,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2023-08-29 20:32:06,690 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 6 predicate places. [2023-08-29 20:32:06,690 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 216 flow [2023-08-29 20:32:06,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 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) [2023-08-29 20:32:06,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:06,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:32:06,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-29 20:32:06,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/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 [2023-08-29 20:32:06,902 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:32:06,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:06,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1266428526, now seen corresponding path program 1 times [2023-08-29 20:32:06,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:32:06,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [542965379] [2023-08-29 20:32:06,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:32:06,904 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 [2023-08-29 20:32:06,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:32:06,905 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/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) [2023-08-29 20:32:06,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-29 20:32:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:32:07,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-29 20:32:07,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:32:07,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:32:07,762 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:32:07,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:32:07,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [542965379] [2023-08-29 20:32:07,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [542965379] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:07,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:07,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:32:07,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307127052] [2023-08-29 20:32:07,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:07,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:32:07,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:32:07,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:32:07,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:32:08,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 271 [2023-08-29 20:32:08,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 109.16666666666667) internal successors, (655), 6 states have internal predecessors, (655), 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) [2023-08-29 20:32:08,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:08,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 271 [2023-08-29 20:32:08,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:08,653 INFO L130 PetriNetUnfolder]: 1657/2548 cut-off events. [2023-08-29 20:32:08,653 INFO L131 PetriNetUnfolder]: For 1911/1911 co-relation queries the response was YES. [2023-08-29 20:32:08,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7471 conditions, 2548 events. 1657/2548 cut-off events. For 1911/1911 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 13144 event pairs, 224 based on Foata normal form. 4/2552 useless extension candidates. Maximal degree in co-relation 7458. Up to 2279 conditions per place. [2023-08-29 20:32:08,666 INFO L137 encePairwiseOnDemand]: 266/271 looper letters, 47 selfloop transitions, 4 changer transitions 18/72 dead transitions. [2023-08-29 20:32:08,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 72 transitions, 466 flow [2023-08-29 20:32:08,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:32:08,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:32:08,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 674 transitions. [2023-08-29 20:32:08,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4145141451414514 [2023-08-29 20:32:08,670 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 674 transitions. [2023-08-29 20:32:08,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 674 transitions. [2023-08-29 20:32:08,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:08,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 674 transitions. [2023-08-29 20:32:08,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 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) [2023-08-29 20:32:08,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 271.0) internal successors, (1897), 7 states have internal predecessors, (1897), 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) [2023-08-29 20:32:08,675 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 271.0) internal successors, (1897), 7 states have internal predecessors, (1897), 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) [2023-08-29 20:32:08,675 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 216 flow. Second operand 6 states and 674 transitions. [2023-08-29 20:32:08,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 72 transitions, 466 flow [2023-08-29 20:32:08,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 72 transitions, 464 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:32:08,697 INFO L231 Difference]: Finished difference. Result has 62 places, 40 transitions, 180 flow [2023-08-29 20:32:08,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=62, PETRI_TRANSITIONS=40} [2023-08-29 20:32:08,698 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 9 predicate places. [2023-08-29 20:32:08,698 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 40 transitions, 180 flow [2023-08-29 20:32:08,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.16666666666667) internal successors, (655), 6 states have internal predecessors, (655), 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) [2023-08-29 20:32:08,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:08,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:32:08,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-29 20:32:08,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/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 [2023-08-29 20:32:08,913 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:32:08,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:08,913 INFO L85 PathProgramCache]: Analyzing trace with hash 863787042, now seen corresponding path program 3 times [2023-08-29 20:32:08,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:32:08,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [938889881] [2023-08-29 20:32:08,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:32:08,914 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 [2023-08-29 20:32:08,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:32:08,919 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/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) [2023-08-29 20:32:08,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-29 20:32:09,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:32:09,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:32:09,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:32:09,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:32:09,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:32:09,077 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:32:09,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:32:09,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [938889881] [2023-08-29 20:32:09,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [938889881] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:09,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:09,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:32:09,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176464661] [2023-08-29 20:32:09,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:09,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:32:09,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:32:09,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:32:09,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:32:09,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 271 [2023-08-29 20:32:09,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 40 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 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) [2023-08-29 20:32:09,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:09,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 271 [2023-08-29 20:32:09,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:09,421 INFO L130 PetriNetUnfolder]: 1462/2272 cut-off events. [2023-08-29 20:32:09,421 INFO L131 PetriNetUnfolder]: For 1640/1659 co-relation queries the response was YES. [2023-08-29 20:32:09,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6685 conditions, 2272 events. 1462/2272 cut-off events. For 1640/1659 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11642 event pairs, 629 based on Foata normal form. 4/2251 useless extension candidates. Maximal degree in co-relation 6672. Up to 1308 conditions per place. [2023-08-29 20:32:09,431 INFO L137 encePairwiseOnDemand]: 267/271 looper letters, 57 selfloop transitions, 2 changer transitions 12/73 dead transitions. [2023-08-29 20:32:09,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 73 transitions, 476 flow [2023-08-29 20:32:09,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:32:09,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:32:09,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 524 transitions. [2023-08-29 20:32:09,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4833948339483395 [2023-08-29 20:32:09,433 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 524 transitions. [2023-08-29 20:32:09,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 524 transitions. [2023-08-29 20:32:09,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:09,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 524 transitions. [2023-08-29 20:32:09,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 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) [2023-08-29 20:32:09,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 271.0) internal successors, (1355), 5 states have internal predecessors, (1355), 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) [2023-08-29 20:32:09,437 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 271.0) internal successors, (1355), 5 states have internal predecessors, (1355), 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) [2023-08-29 20:32:09,438 INFO L175 Difference]: Start difference. First operand has 62 places, 40 transitions, 180 flow. Second operand 4 states and 524 transitions. [2023-08-29 20:32:09,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 73 transitions, 476 flow [2023-08-29 20:32:09,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 73 transitions, 445 flow, removed 6 selfloop flow, removed 9 redundant places. [2023-08-29 20:32:09,452 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 171 flow [2023-08-29 20:32:09,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2023-08-29 20:32:09,453 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2023-08-29 20:32:09,453 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 171 flow [2023-08-29 20:32:09,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 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) [2023-08-29 20:32:09,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:09,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:32:09,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-29 20:32:09,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/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 [2023-08-29 20:32:09,662 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:32:09,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:09,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1369792474, now seen corresponding path program 4 times [2023-08-29 20:32:09,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:32:09,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839953437] [2023-08-29 20:32:09,663 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 20:32:09,663 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 [2023-08-29 20:32:09,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:32:09,664 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/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) [2023-08-29 20:32:09,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-29 20:32:09,771 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 20:32:09,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:32:09,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:32:09,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:32:09,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:32:09,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:32:09,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:32:09,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [839953437] [2023-08-29 20:32:09,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [839953437] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:32:09,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:32:09,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:32:09,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113215607] [2023-08-29 20:32:09,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:32:09,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:32:09,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:32:09,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:32:09,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:32:09,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 271 [2023-08-29 20:32:09,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 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) [2023-08-29 20:32:09,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:32:09,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 271 [2023-08-29 20:32:09,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:32:10,053 INFO L130 PetriNetUnfolder]: 1116/1771 cut-off events. [2023-08-29 20:32:10,053 INFO L131 PetriNetUnfolder]: For 1468/1488 co-relation queries the response was YES. [2023-08-29 20:32:10,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5229 conditions, 1771 events. 1116/1771 cut-off events. For 1468/1488 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8317 event pairs, 459 based on Foata normal form. 4/1758 useless extension candidates. Maximal degree in co-relation 5218. Up to 1039 conditions per place. [2023-08-29 20:32:10,059 INFO L137 encePairwiseOnDemand]: 267/271 looper letters, 42 selfloop transitions, 2 changer transitions 24/70 dead transitions. [2023-08-29 20:32:10,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 70 transitions, 443 flow [2023-08-29 20:32:10,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:32:10,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:32:10,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 521 transitions. [2023-08-29 20:32:10,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4806273062730627 [2023-08-29 20:32:10,067 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 521 transitions. [2023-08-29 20:32:10,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 521 transitions. [2023-08-29 20:32:10,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:32:10,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 521 transitions. [2023-08-29 20:32:10,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 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) [2023-08-29 20:32:10,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 271.0) internal successors, (1355), 5 states have internal predecessors, (1355), 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) [2023-08-29 20:32:10,071 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 271.0) internal successors, (1355), 5 states have internal predecessors, (1355), 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) [2023-08-29 20:32:10,071 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 171 flow. Second operand 4 states and 521 transitions. [2023-08-29 20:32:10,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 70 transitions, 443 flow [2023-08-29 20:32:10,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 70 transitions, 433 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-29 20:32:10,081 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 173 flow [2023-08-29 20:32:10,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2023-08-29 20:32:10,081 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2023-08-29 20:32:10,081 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 173 flow [2023-08-29 20:32:10,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 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) [2023-08-29 20:32:10,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:32:10,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:32:10,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-08-29 20:32:10,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/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 [2023-08-29 20:32:10,292 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:32:10,293 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:32:10,293 INFO L85 PathProgramCache]: Analyzing trace with hash 2031041032, now seen corresponding path program 5 times [2023-08-29 20:32:10,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:32:10,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660110650] [2023-08-29 20:32:10,293 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-29 20:32:10,294 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 [2023-08-29 20:32:10,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:32:10,295 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/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) [2023-08-29 20:32:10,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-08-29 20:32:10,440 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:32:10,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:32:10,440 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:32:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:32:10,581 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:32:10,581 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:32:10,582 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-29 20:32:10,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-29 20:32:10,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-29 20:32:10,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-29 20:32:10,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-29 20:32:10,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-29 20:32:10,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-29 20:32:10,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-29 20:32:10,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-29 20:32:10,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-29 20:32:10,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-29 20:32:10,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-29 20:32:10,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-29 20:32:10,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-29 20:32:10,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-29 20:32:10,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-29 20:32:10,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-08-29 20:32:10,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/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 [2023-08-29 20:32:10,797 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:32:10,801 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:32:10,801 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:32:10,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:32:10 BasicIcfg [2023-08-29 20:32:10,889 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:32:10,890 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:32:10,890 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:32:10,890 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:32:10,890 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:31:49" (3/4) ... [2023-08-29 20:32:10,895 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:32:10,895 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:32:10,896 INFO L158 Benchmark]: Toolchain (without parser) took 22521.08ms. Allocated memory was 94.4MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 70.5MB in the beginning and 1.0GB in the end (delta: -970.1MB). Peak memory consumption was 758.9MB. Max. memory is 16.1GB. [2023-08-29 20:32:10,896 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 62.9MB. Free memory was 41.1MB in the beginning and 41.0MB in the end (delta: 56.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:32:10,896 INFO L158 Benchmark]: CACSL2BoogieTranslator took 572.38ms. Allocated memory is still 94.4MB. Free memory was 70.1MB in the beginning and 67.2MB in the end (delta: 3.0MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2023-08-29 20:32:10,896 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.29ms. Allocated memory is still 94.4MB. Free memory was 67.2MB in the beginning and 65.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:32:10,897 INFO L158 Benchmark]: Boogie Preprocessor took 31.25ms. Allocated memory is still 94.4MB. Free memory was 64.9MB in the beginning and 62.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:32:10,897 INFO L158 Benchmark]: RCFGBuilder took 871.60ms. Allocated memory is still 94.4MB. Free memory was 62.3MB in the beginning and 50.4MB in the end (delta: 11.9MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2023-08-29 20:32:10,897 INFO L158 Benchmark]: TraceAbstraction took 20986.83ms. Allocated memory was 94.4MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 49.8MB in the beginning and 1.0GB in the end (delta: -991.8MB). Peak memory consumption was 733.2MB. Max. memory is 16.1GB. [2023-08-29 20:32:10,898 INFO L158 Benchmark]: Witness Printer took 5.54ms. Allocated memory is still 1.8GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:32:10,900 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 62.9MB. Free memory was 41.1MB in the beginning and 41.0MB in the end (delta: 56.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 572.38ms. Allocated memory is still 94.4MB. Free memory was 70.1MB in the beginning and 67.2MB in the end (delta: 3.0MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.29ms. Allocated memory is still 94.4MB. Free memory was 67.2MB in the beginning and 65.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.25ms. Allocated memory is still 94.4MB. Free memory was 64.9MB in the beginning and 62.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 871.60ms. Allocated memory is still 94.4MB. Free memory was 62.3MB in the beginning and 50.4MB in the end (delta: 11.9MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. * TraceAbstraction took 20986.83ms. Allocated memory was 94.4MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 49.8MB in the beginning and 1.0GB in the end (delta: -991.8MB). Peak memory consumption was 733.2MB. Max. memory is 16.1GB. * Witness Printer took 5.54ms. Allocated memory is still 1.8GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.7s, 147 PlacesBefore, 53 PlacesAfterwards, 136 TransitionsBefore, 41 TransitionsAfterwards, 3412 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 69 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 131 TotalNumberOfCompositions, 10014 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3421, independent: 3181, independent conditional: 0, independent unconditional: 3181, dependent: 240, dependent conditional: 0, dependent unconditional: 240, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1717, independent: 1668, independent conditional: 0, independent unconditional: 1668, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3421, independent: 1513, independent conditional: 0, independent unconditional: 1513, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 1717, unknown conditional: 0, unknown unconditional: 1717] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 143, Positive conditional cache size: 0, Positive unconditional cache size: 143, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool a$flush_delayed; [L716] 0 int a$mem_tmp; [L717] 0 _Bool a$r_buff0_thd0; [L718] 0 _Bool a$r_buff0_thd1; [L719] 0 _Bool a$r_buff0_thd2; [L720] 0 _Bool a$r_buff0_thd3; [L721] 0 _Bool a$r_buff0_thd4; [L722] 0 _Bool a$r_buff1_thd0; [L723] 0 _Bool a$r_buff1_thd1; [L724] 0 _Bool a$r_buff1_thd2; [L725] 0 _Bool a$r_buff1_thd3; [L726] 0 _Bool a$r_buff1_thd4; [L727] 0 _Bool a$read_delayed; [L728] 0 int *a$read_delayed_var; [L729] 0 int a$w_buff0; [L730] 0 _Bool a$w_buff0_used; [L731] 0 int a$w_buff1; [L732] 0 _Bool a$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L857] 0 pthread_t t1513; [L858] FCALL, FORK 0 pthread_create(&t1513, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1513, ((void *)0), P0, ((void *)0))=0, t1513={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L859] 0 pthread_t t1514; [L746] 1 a$w_buff1 = a$w_buff0 [L747] 1 a$w_buff0 = 1 [L748] 1 a$w_buff1_used = a$w_buff0_used [L749] 1 a$w_buff0_used = (_Bool)1 [L750] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L750] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L751] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L752] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L753] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L754] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L755] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L860] FCALL, FORK 0 pthread_create(&t1514, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1514, ((void *)0), P1, ((void *)0))=1, t1513={3:0}, t1514={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L861] 0 pthread_t t1515; [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L862] FCALL, FORK 0 pthread_create(&t1515, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1515, ((void *)0), P2, ((void *)0))=2, t1513={3:0}, t1514={7:0}, t1515={11:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L863] 0 pthread_t t1516; [L779] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L796] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L802] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L803] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L804] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L805] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L806] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L864] FCALL, FORK 0 pthread_create(&t1516, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1516, ((void *)0), P3, ((void *)0))=3, t1513={3:0}, t1514={7:0}, t1515={11:0}, t1516={15:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L816] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L819] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L820] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L821] 4 a$flush_delayed = weak$$choice2 [L822] 4 a$mem_tmp = a [L823] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L824] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L825] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L826] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L827] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L828] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L829] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 __unbuffered_p3_EAX = a [L831] 4 a = a$flush_delayed ? a$mem_tmp : a [L832] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L835] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L836] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L837] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L838] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L839] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] [L809] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L811] 3 return 0; [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L842] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L844] 4 return 0; [L866] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L868] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L868] RET 0 assume_abort_if_not(main$tmp_guard0) [L870] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L871] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L872] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L873] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L874] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1513={3:0}, t1514={7:0}, t1515={11:0}, t1516={15:0}, weak$$choice2=0, x=2, y=2, z=2] [L877] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 176 locations, 16 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: 20.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 602 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 492 mSDsluCounter, 253 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 201 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2338 IncrementalHoareTripleChecker+Invalid, 2412 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 52 mSDtfsCounter, 2338 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 215 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=226occurred in iteration=5, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 244 NumberOfCodeBlocks, 244 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 205 ConstructedInterpolants, 16 QuantifiedInterpolants, 1862 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1679 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 [2023-08-29 20:32:10,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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