./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe003_power.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --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/safe003_power.opt.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 91a9aa2f0d12b9c007fce98740577392f81daf83caae08bbaade32d740f10d38 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:30:09,981 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:30:09,982 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:30:10,007 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:30:10,009 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:30:10,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:30:10,015 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:30:10,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:30:10,019 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:30:10,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:30:10,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:30:10,026 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:30:10,027 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:30:10,029 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:30:10,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:30:10,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:30:10,032 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:30:10,033 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:30:10,034 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:30:10,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:30:10,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:30:10,046 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:30:10,047 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:30:10,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:30:10,049 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:30:10,050 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:30:10,051 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:30:10,051 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:30:10,052 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:30:10,053 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:30:10,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:30:10,054 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:30:10,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:30:10,055 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:30:10,056 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:30:10,057 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:30:10,057 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:30:10,057 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:30:10,058 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:30:10,058 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:30:10,058 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:30:10,060 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-31 23:30:10,085 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:30:10,085 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:30:10,086 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:30:10,086 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:30:10,087 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:30:10,087 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:30:10,088 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:30:10,088 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:30:10,088 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:30:10,088 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:30:10,089 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:30:10,089 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:30:10,089 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:30:10,089 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:30:10,089 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:30:10,089 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:30:10,090 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:30:10,090 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:30:10,090 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:30:10,090 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:30:10,090 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:30:10,090 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:30:10,090 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:30:10,091 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:30:10,091 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:30:10,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:30:10,091 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:30:10,091 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:30:10,091 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:30:10,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:30:10,092 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:30:10,092 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:30:10,092 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:30:10,092 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:30:10,092 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 -> 91a9aa2f0d12b9c007fce98740577392f81daf83caae08bbaade32d740f10d38 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 -> BEFORE [2023-08-31 23:30:10,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:30:10,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:30:10,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:30:10,342 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:30:10,343 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:30:10,343 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe003_power.opt.i [2023-08-31 23:30:11,191 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:30:11,381 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:30:11,381 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_power.opt.i [2023-08-31 23:30:11,405 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a267a15a5/f00b683e6fa3428c84460510f07a1dc9/FLAGad2ef0346 [2023-08-31 23:30:11,419 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a267a15a5/f00b683e6fa3428c84460510f07a1dc9 [2023-08-31 23:30:11,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:30:11,421 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:30:11,422 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:30:11,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:30:11,424 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:30:11,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:30:11" (1/1) ... [2023-08-31 23:30:11,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77e25824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:30:11, skipping insertion in model container [2023-08-31 23:30:11,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:30:11" (1/1) ... [2023-08-31 23:30:11,429 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:30:11,463 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:30:11,561 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/safe003_power.opt.i[951,964] [2023-08-31 23:30:11,714 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:30:11,728 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:30:11,737 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/safe003_power.opt.i[951,964] [2023-08-31 23:30:11,786 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:30:11,817 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:30:11,818 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:30:11,823 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:30:11,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:30:11 WrapperNode [2023-08-31 23:30:11,823 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:30:11,824 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:30:11,824 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:30:11,824 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:30:11,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:30:11" (1/1) ... [2023-08-31 23:30:11,856 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:30:11" (1/1) ... [2023-08-31 23:30:11,876 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 181 [2023-08-31 23:30:11,878 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:30:11,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:30:11,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:30:11,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:30:11,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:30:11" (1/1) ... [2023-08-31 23:30:11,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:30:11" (1/1) ... [2023-08-31 23:30:11,903 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:30:11" (1/1) ... [2023-08-31 23:30:11,903 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:30:11" (1/1) ... [2023-08-31 23:30:11,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:30:11" (1/1) ... [2023-08-31 23:30:11,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:30:11" (1/1) ... [2023-08-31 23:30:11,927 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:30:11" (1/1) ... [2023-08-31 23:30:11,931 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:30:11" (1/1) ... [2023-08-31 23:30:11,934 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:30:11,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:30:11,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:30:11,938 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:30:11,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:30:11" (1/1) ... [2023-08-31 23:30:11,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:30:11,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:30:11,962 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-31 23:30:11,980 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-31 23:30:11,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-31 23:30:11,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:30:11,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:30:11,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:30:11,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:30:11,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:30:11,991 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:30:11,991 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:30:11,992 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:30:11,992 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:30:11,992 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:30:11,992 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:30:11,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:30:11,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:30:11,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:30:11,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:30:11,994 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:30:12,159 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:30:12,160 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:30:12,552 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:30:12,935 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:30:12,936 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:30:12,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:30:12 BoogieIcfgContainer [2023-08-31 23:30:12,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:30:12,940 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:30:12,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:30:12,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:30:12,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:30:11" (1/3) ... [2023-08-31 23:30:12,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7967ba41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:30:12, skipping insertion in model container [2023-08-31 23:30:12,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:30:11" (2/3) ... [2023-08-31 23:30:12,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7967ba41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:30:12, skipping insertion in model container [2023-08-31 23:30:12,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:30:12" (3/3) ... [2023-08-31 23:30:12,944 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.opt.i [2023-08-31 23:30:12,955 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:30:12,955 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2023-08-31 23:30:12,956 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:30:13,040 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:30:13,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 171 transitions, 357 flow [2023-08-31 23:30:13,136 INFO L130 PetriNetUnfolder]: 2/168 cut-off events. [2023-08-31 23:30:13,137 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:30:13,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 168 events. 2/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 249 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-08-31 23:30:13,141 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 171 transitions, 357 flow [2023-08-31 23:30:13,147 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 168 transitions, 345 flow [2023-08-31 23:30:13,151 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:30:13,159 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 168 transitions, 345 flow [2023-08-31 23:30:13,161 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 168 transitions, 345 flow [2023-08-31 23:30:13,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 168 transitions, 345 flow [2023-08-31 23:30:13,201 INFO L130 PetriNetUnfolder]: 2/168 cut-off events. [2023-08-31 23:30:13,201 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:30:13,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 168 events. 2/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 246 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-08-31 23:30:13,205 INFO L119 LiptonReduction]: Number of co-enabled transitions 6224 [2023-08-31 23:30:23,126 INFO L134 LiptonReduction]: Checked pairs total: 34669 [2023-08-31 23:30:23,126 INFO L136 LiptonReduction]: Total number of compositions: 144 [2023-08-31 23:30:23,141 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:30:23,145 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;@4e57ead, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:30:23,145 INFO L358 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2023-08-31 23:30:23,146 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:30:23,146 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:30:23,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:23,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:30:23,148 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:30:23,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:23,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1117, now seen corresponding path program 1 times [2023-08-31 23:30:23,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:30:23,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036698767] [2023-08-31 23:30:23,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:30:23,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:30:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:30:23,243 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-31 23:30:23,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:30:23,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036698767] [2023-08-31 23:30:23,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036698767] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:23,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:23,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:30:23,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324351198] [2023-08-31 23:30:23,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:23,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:30:23,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:30:23,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:30:23,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:30:23,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 315 [2023-08-31 23:30:23,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 71 transitions, 151 flow. Second operand has 2 states, 2 states have (on average 123.5) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 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-31 23:30:23,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:23,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 315 [2023-08-31 23:30:23,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:27,540 INFO L130 PetriNetUnfolder]: 31868/44399 cut-off events. [2023-08-31 23:30:27,540 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-31 23:30:27,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88825 conditions, 44399 events. 31868/44399 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 3422. Compared 316871 event pairs, 31868 based on Foata normal form. 0/17974 useless extension candidates. Maximal degree in co-relation 88814. Up to 44200 conditions per place. [2023-08-31 23:30:27,761 INFO L137 encePairwiseOnDemand]: 294/315 looper letters, 47 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2023-08-31 23:30:27,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 201 flow [2023-08-31 23:30:27,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:30:27,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:30:27,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 314 transitions. [2023-08-31 23:30:27,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4984126984126984 [2023-08-31 23:30:27,774 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 314 transitions. [2023-08-31 23:30:27,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 314 transitions. [2023-08-31 23:30:27,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:27,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 314 transitions. [2023-08-31 23:30:27,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 157.0) internal successors, (314), 2 states have internal predecessors, (314), 0 states have call successors, (0), 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-31 23:30:27,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 0 states have call successors, (0), 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-31 23:30:27,784 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 0 states have call successors, (0), 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-31 23:30:27,785 INFO L175 Difference]: Start difference. First operand has 80 places, 71 transitions, 151 flow. Second operand 2 states and 314 transitions. [2023-08-31 23:30:27,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 201 flow [2023-08-31 23:30:27,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 198 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:30:27,793 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 104 flow [2023-08-31 23:30:27,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=104, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2023-08-31 23:30:27,796 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -23 predicate places. [2023-08-31 23:30:27,796 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 104 flow [2023-08-31 23:30:27,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 123.5) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 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-31 23:30:27,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:27,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-31 23:30:27,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:30:27,800 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:30:27,806 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:27,806 INFO L85 PathProgramCache]: Analyzing trace with hash 34183690, now seen corresponding path program 1 times [2023-08-31 23:30:27,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:30:27,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041236749] [2023-08-31 23:30:27,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:30:27,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:30:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:30:28,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-31 23:30:28,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:30:28,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041236749] [2023-08-31 23:30:28,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041236749] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:28,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:28,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:30:28,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927405795] [2023-08-31 23:30:28,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:28,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:30:28,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:30:28,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:30:28,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:30:28,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 315 [2023-08-31 23:30:28,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 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-31 23:30:28,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:28,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 315 [2023-08-31 23:30:28,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:31,687 INFO L130 PetriNetUnfolder]: 28558/39696 cut-off events. [2023-08-31 23:30:31,687 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:30:31,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79555 conditions, 39696 events. 28558/39696 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3098. Compared 303326 event pairs, 5388 based on Foata normal form. 0/16866 useless extension candidates. Maximal degree in co-relation 79552. Up to 31802 conditions per place. [2023-08-31 23:30:31,852 INFO L137 encePairwiseOnDemand]: 312/315 looper letters, 80 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2023-08-31 23:30:31,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 84 transitions, 342 flow [2023-08-31 23:30:31,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:30:31,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:30:31,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2023-08-31 23:30:31,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47513227513227513 [2023-08-31 23:30:31,855 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2023-08-31 23:30:31,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2023-08-31 23:30:31,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:31,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2023-08-31 23:30:31,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 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-31 23:30:31,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 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-31 23:30:31,858 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 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-31 23:30:31,858 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 104 flow. Second operand 3 states and 449 transitions. [2023-08-31 23:30:31,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 84 transitions, 342 flow [2023-08-31 23:30:31,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 342 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:30:31,860 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 106 flow [2023-08-31 23:30:31,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2023-08-31 23:30:31,861 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -22 predicate places. [2023-08-31 23:30:31,861 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 106 flow [2023-08-31 23:30:31,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 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-31 23:30:31,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:31,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-31 23:30:31,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:30:31,862 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:30:31,862 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:31,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1059695312, now seen corresponding path program 1 times [2023-08-31 23:30:31,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:30:31,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417290521] [2023-08-31 23:30:31,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:30:31,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:30:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:30:31,970 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-31 23:30:31,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:30:31,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417290521] [2023-08-31 23:30:31,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417290521] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:31,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:31,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:30:31,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63946716] [2023-08-31 23:30:31,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:31,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:30:31,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:30:31,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:30:31,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:30:32,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 315 [2023-08-31 23:30:32,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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-31 23:30:32,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:32,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 315 [2023-08-31 23:30:32,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:34,058 INFO L130 PetriNetUnfolder]: 17406/25455 cut-off events. [2023-08-31 23:30:34,059 INFO L131 PetriNetUnfolder]: For 921/921 co-relation queries the response was YES. [2023-08-31 23:30:34,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51637 conditions, 25455 events. 17406/25455 cut-off events. For 921/921 co-relation queries the response was YES. Maximal size of possible extension queue 1863. Compared 181129 event pairs, 10856 based on Foata normal form. 0/13741 useless extension candidates. Maximal degree in co-relation 51633. Up to 14741 conditions per place. [2023-08-31 23:30:34,173 INFO L137 encePairwiseOnDemand]: 297/315 looper letters, 55 selfloop transitions, 9 changer transitions 0/66 dead transitions. [2023-08-31 23:30:34,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 66 transitions, 272 flow [2023-08-31 23:30:34,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:30:34,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:30:34,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2023-08-31 23:30:34,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.455026455026455 [2023-08-31 23:30:34,174 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2023-08-31 23:30:34,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2023-08-31 23:30:34,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:34,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2023-08-31 23:30:34,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 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-31 23:30:34,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 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-31 23:30:34,178 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 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-31 23:30:34,178 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 106 flow. Second operand 3 states and 430 transitions. [2023-08-31 23:30:34,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 66 transitions, 272 flow [2023-08-31 23:30:34,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 66 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:30:34,180 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 176 flow [2023-08-31 23:30:34,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2023-08-31 23:30:34,181 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -22 predicate places. [2023-08-31 23:30:34,184 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 176 flow [2023-08-31 23:30:34,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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-31 23:30:34,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:34,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-31 23:30:34,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:30:34,185 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:30:34,185 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:34,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1059695313, now seen corresponding path program 1 times [2023-08-31 23:30:34,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:30:34,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41017995] [2023-08-31 23:30:34,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:30:34,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:30:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:30:34,291 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-31 23:30:34,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:30:34,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41017995] [2023-08-31 23:30:34,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41017995] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:34,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:34,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:30:34,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737143736] [2023-08-31 23:30:34,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:34,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:30:34,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:30:34,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:30:34,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:30:34,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 315 [2023-08-31 23:30:34,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 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-31 23:30:34,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:34,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 315 [2023-08-31 23:30:34,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:35,298 INFO L130 PetriNetUnfolder]: 5214/8034 cut-off events. [2023-08-31 23:30:35,298 INFO L131 PetriNetUnfolder]: For 2191/2191 co-relation queries the response was YES. [2023-08-31 23:30:35,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21986 conditions, 8034 events. 5214/8034 cut-off events. For 2191/2191 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 50704 event pairs, 4096 based on Foata normal form. 1723/8447 useless extension candidates. Maximal degree in co-relation 21981. Up to 7882 conditions per place. [2023-08-31 23:30:35,331 INFO L137 encePairwiseOnDemand]: 305/315 looper letters, 41 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2023-08-31 23:30:35,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 44 transitions, 242 flow [2023-08-31 23:30:35,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:30:35,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:30:35,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-08-31 23:30:35,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43386243386243384 [2023-08-31 23:30:35,333 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-08-31 23:30:35,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-08-31 23:30:35,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:35,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-08-31 23:30:35,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 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-31 23:30:35,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 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-31 23:30:35,337 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 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-31 23:30:35,337 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 176 flow. Second operand 3 states and 410 transitions. [2023-08-31 23:30:35,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 44 transitions, 242 flow [2023-08-31 23:30:35,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 44 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:30:35,354 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 142 flow [2023-08-31 23:30:35,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2023-08-31 23:30:35,355 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -31 predicate places. [2023-08-31 23:30:35,355 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 142 flow [2023-08-31 23:30:35,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 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-31 23:30:35,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:35,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:30:35,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:30:35,356 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:30:35,356 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:35,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1379766903, now seen corresponding path program 1 times [2023-08-31 23:30:35,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:30:35,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950648023] [2023-08-31 23:30:35,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:30:35,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:30:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:30:35,438 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-31 23:30:35,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:30:35,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950648023] [2023-08-31 23:30:35,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950648023] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:35,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:35,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:30:35,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123244247] [2023-08-31 23:30:35,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:35,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:30:35,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:30:35,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:30:35,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:30:35,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 315 [2023-08-31 23:30:35,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 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-31 23:30:35,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:35,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 315 [2023-08-31 23:30:35,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:36,172 INFO L130 PetriNetUnfolder]: 5112/8033 cut-off events. [2023-08-31 23:30:36,172 INFO L131 PetriNetUnfolder]: For 919/944 co-relation queries the response was YES. [2023-08-31 23:30:36,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20363 conditions, 8033 events. 5112/8033 cut-off events. For 919/944 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 52869 event pairs, 1762 based on Foata normal form. 0/6088 useless extension candidates. Maximal degree in co-relation 20358. Up to 6126 conditions per place. [2023-08-31 23:30:36,200 INFO L137 encePairwiseOnDemand]: 311/315 looper letters, 66 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2023-08-31 23:30:36,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 71 transitions, 366 flow [2023-08-31 23:30:36,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:30:36,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:30:36,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-08-31 23:30:36,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4497354497354497 [2023-08-31 23:30:36,202 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-08-31 23:30:36,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-08-31 23:30:36,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:36,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-08-31 23:30:36,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 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-31 23:30:36,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 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-31 23:30:36,205 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 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-31 23:30:36,205 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 142 flow. Second operand 3 states and 425 transitions. [2023-08-31 23:30:36,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 71 transitions, 366 flow [2023-08-31 23:30:36,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 71 transitions, 365 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:30:36,207 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 154 flow [2023-08-31 23:30:36,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2023-08-31 23:30:36,207 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -29 predicate places. [2023-08-31 23:30:36,208 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 154 flow [2023-08-31 23:30:36,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 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-31 23:30:36,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:36,208 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:30:36,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:30:36,208 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:30:36,209 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:36,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1379767153, now seen corresponding path program 1 times [2023-08-31 23:30:36,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:30:36,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306717354] [2023-08-31 23:30:36,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:30:36,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:30:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:30:36,342 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-31 23:30:36,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:30:36,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306717354] [2023-08-31 23:30:36,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306717354] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:36,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:36,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:30:36,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587982961] [2023-08-31 23:30:36,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:36,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:30:36,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:30:36,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:30:36,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:30:36,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 315 [2023-08-31 23:30:36,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 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-31 23:30:36,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:36,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 315 [2023-08-31 23:30:36,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:37,058 INFO L130 PetriNetUnfolder]: 5061/8180 cut-off events. [2023-08-31 23:30:37,059 INFO L131 PetriNetUnfolder]: For 2022/2022 co-relation queries the response was YES. [2023-08-31 23:30:37,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21279 conditions, 8180 events. 5061/8180 cut-off events. For 2022/2022 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 55346 event pairs, 983 based on Foata normal form. 0/6483 useless extension candidates. Maximal degree in co-relation 21273. Up to 6512 conditions per place. [2023-08-31 23:30:37,085 INFO L137 encePairwiseOnDemand]: 312/315 looper letters, 67 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2023-08-31 23:30:37,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 392 flow [2023-08-31 23:30:37,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:30:37,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:30:37,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2023-08-31 23:30:37,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2023-08-31 23:30:37,087 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2023-08-31 23:30:37,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2023-08-31 23:30:37,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:37,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2023-08-31 23:30:37,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 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-31 23:30:37,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 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-31 23:30:37,092 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 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-31 23:30:37,092 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 154 flow. Second operand 3 states and 420 transitions. [2023-08-31 23:30:37,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 71 transitions, 392 flow [2023-08-31 23:30:37,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 71 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:30:37,094 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 156 flow [2023-08-31 23:30:37,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2023-08-31 23:30:37,095 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -28 predicate places. [2023-08-31 23:30:37,095 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 156 flow [2023-08-31 23:30:37,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 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-31 23:30:37,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:37,095 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:30:37,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:30:37,096 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:30:37,101 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:37,101 INFO L85 PathProgramCache]: Analyzing trace with hash 432917052, now seen corresponding path program 1 times [2023-08-31 23:30:37,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:30:37,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960308425] [2023-08-31 23:30:37,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:30:37,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:30:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:30:37,484 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-31 23:30:37,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:30:37,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960308425] [2023-08-31 23:30:37,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960308425] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:37,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:37,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:30:37,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326686503] [2023-08-31 23:30:37,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:37,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:30:37,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:30:37,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:30:37,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:30:37,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 315 [2023-08-31 23:30:37,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 156 flow. Second operand has 7 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 0 states have call successors, (0), 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-31 23:30:37,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:37,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 315 [2023-08-31 23:30:37,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:39,057 INFO L130 PetriNetUnfolder]: 10213/15636 cut-off events. [2023-08-31 23:30:39,058 INFO L131 PetriNetUnfolder]: For 2847/2886 co-relation queries the response was YES. [2023-08-31 23:30:39,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42695 conditions, 15636 events. 10213/15636 cut-off events. For 2847/2886 co-relation queries the response was YES. Maximal size of possible extension queue 1181. Compared 110469 event pairs, 2570 based on Foata normal form. 120/12142 useless extension candidates. Maximal degree in co-relation 42688. Up to 6159 conditions per place. [2023-08-31 23:30:39,124 INFO L137 encePairwiseOnDemand]: 305/315 looper letters, 186 selfloop transitions, 28 changer transitions 0/216 dead transitions. [2023-08-31 23:30:39,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 216 transitions, 1175 flow [2023-08-31 23:30:39,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-31 23:30:39,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-31 23:30:39,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1409 transitions. [2023-08-31 23:30:39,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40663780663780663 [2023-08-31 23:30:39,127 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1409 transitions. [2023-08-31 23:30:39,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1409 transitions. [2023-08-31 23:30:39,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:39,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1409 transitions. [2023-08-31 23:30:39,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 128.0909090909091) internal successors, (1409), 11 states have internal predecessors, (1409), 0 states have call successors, (0), 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-31 23:30:39,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 315.0) internal successors, (3780), 12 states have internal predecessors, (3780), 0 states have call successors, (0), 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-31 23:30:39,134 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 315.0) internal successors, (3780), 12 states have internal predecessors, (3780), 0 states have call successors, (0), 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-31 23:30:39,134 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 156 flow. Second operand 11 states and 1409 transitions. [2023-08-31 23:30:39,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 216 transitions, 1175 flow [2023-08-31 23:30:39,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 216 transitions, 1153 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:30:39,139 INFO L231 Difference]: Finished difference. Result has 67 places, 71 transitions, 398 flow [2023-08-31 23:30:39,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=398, PETRI_PLACES=67, PETRI_TRANSITIONS=71} [2023-08-31 23:30:39,139 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -13 predicate places. [2023-08-31 23:30:39,139 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 71 transitions, 398 flow [2023-08-31 23:30:39,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 0 states have call successors, (0), 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-31 23:30:39,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:39,140 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:30:39,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:30:39,140 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:30:39,140 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:39,141 INFO L85 PathProgramCache]: Analyzing trace with hash -178400329, now seen corresponding path program 1 times [2023-08-31 23:30:39,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:30:39,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399222875] [2023-08-31 23:30:39,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:30:39,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:30:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:30:39,260 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-31 23:30:39,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:30:39,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399222875] [2023-08-31 23:30:39,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399222875] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:39,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:39,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:30:39,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702835789] [2023-08-31 23:30:39,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:39,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:30:39,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:30:39,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:30:39,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:30:39,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 315 [2023-08-31 23:30:39,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 71 transitions, 398 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-31 23:30:39,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:39,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 315 [2023-08-31 23:30:39,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:40,726 INFO L130 PetriNetUnfolder]: 12604/18827 cut-off events. [2023-08-31 23:30:40,726 INFO L131 PetriNetUnfolder]: For 14466/14466 co-relation queries the response was YES. [2023-08-31 23:30:40,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61083 conditions, 18827 events. 12604/18827 cut-off events. For 14466/14466 co-relation queries the response was YES. Maximal size of possible extension queue 1255. Compared 128684 event pairs, 4578 based on Foata normal form. 9/14933 useless extension candidates. Maximal degree in co-relation 61069. Up to 18440 conditions per place. [2023-08-31 23:30:40,820 INFO L137 encePairwiseOnDemand]: 311/315 looper letters, 104 selfloop transitions, 3 changer transitions 0/108 dead transitions. [2023-08-31 23:30:40,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 108 transitions, 813 flow [2023-08-31 23:30:40,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:30:40,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:30:40,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-08-31 23:30:40,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4433862433862434 [2023-08-31 23:30:40,821 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-08-31 23:30:40,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-08-31 23:30:40,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:40,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-08-31 23:30:40,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 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-31 23:30:40,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 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-31 23:30:40,824 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 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-31 23:30:40,824 INFO L175 Difference]: Start difference. First operand has 67 places, 71 transitions, 398 flow. Second operand 3 states and 419 transitions. [2023-08-31 23:30:40,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 108 transitions, 813 flow [2023-08-31 23:30:41,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 108 transitions, 813 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:30:41,214 INFO L231 Difference]: Finished difference. Result has 70 places, 73 transitions, 417 flow [2023-08-31 23:30:41,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=417, PETRI_PLACES=70, PETRI_TRANSITIONS=73} [2023-08-31 23:30:41,215 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -10 predicate places. [2023-08-31 23:30:41,215 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 73 transitions, 417 flow [2023-08-31 23:30:41,215 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-31 23:30:41,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:41,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:30:41,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:30:41,216 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:30:41,216 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:41,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1190757210, now seen corresponding path program 1 times [2023-08-31 23:30:41,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:30:41,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594413882] [2023-08-31 23:30:41,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:30:41,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:30:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:30:41,343 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-31 23:30:41,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:30:41,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594413882] [2023-08-31 23:30:41,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594413882] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:41,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:41,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:30:41,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97115872] [2023-08-31 23:30:41,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:41,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:30:41,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:30:41,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:30:41,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:30:41,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 315 [2023-08-31 23:30:41,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 73 transitions, 417 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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-31 23:30:41,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:41,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 315 [2023-08-31 23:30:41,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:43,043 INFO L130 PetriNetUnfolder]: 14321/21073 cut-off events. [2023-08-31 23:30:43,044 INFO L131 PetriNetUnfolder]: For 17332/17348 co-relation queries the response was YES. [2023-08-31 23:30:43,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69399 conditions, 21073 events. 14321/21073 cut-off events. For 17332/17348 co-relation queries the response was YES. Maximal size of possible extension queue 1352. Compared 140482 event pairs, 3474 based on Foata normal form. 51/16411 useless extension candidates. Maximal degree in co-relation 69383. Up to 15149 conditions per place. [2023-08-31 23:30:43,155 INFO L137 encePairwiseOnDemand]: 312/315 looper letters, 122 selfloop transitions, 2 changer transitions 0/126 dead transitions. [2023-08-31 23:30:43,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 126 transitions, 995 flow [2023-08-31 23:30:43,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:30:43,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:30:43,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-08-31 23:30:43,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4455026455026455 [2023-08-31 23:30:43,157 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-08-31 23:30:43,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-08-31 23:30:43,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:43,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-08-31 23:30:43,158 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-31 23:30:43,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 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-31 23:30:43,159 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 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-31 23:30:43,159 INFO L175 Difference]: Start difference. First operand has 70 places, 73 transitions, 417 flow. Second operand 3 states and 421 transitions. [2023-08-31 23:30:43,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 126 transitions, 995 flow [2023-08-31 23:30:43,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 126 transitions, 991 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:30:43,286 INFO L231 Difference]: Finished difference. Result has 72 places, 73 transitions, 422 flow [2023-08-31 23:30:43,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=422, PETRI_PLACES=72, PETRI_TRANSITIONS=73} [2023-08-31 23:30:43,287 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -8 predicate places. [2023-08-31 23:30:43,287 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 73 transitions, 422 flow [2023-08-31 23:30:43,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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-31 23:30:43,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:43,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:30:43,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:30:43,288 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:30:43,288 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:43,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1188687464, now seen corresponding path program 1 times [2023-08-31 23:30:43,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:30:43,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079936690] [2023-08-31 23:30:43,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:30:43,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:30:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:30:43,416 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-31 23:30:43,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:30:43,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079936690] [2023-08-31 23:30:43,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079936690] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:43,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:43,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:30:43,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271150219] [2023-08-31 23:30:43,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:43,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:30:43,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:30:43,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:30:43,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:30:43,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 315 [2023-08-31 23:30:43,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 73 transitions, 422 flow. Second operand has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 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-31 23:30:43,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:43,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 315 [2023-08-31 23:30:43,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:44,850 INFO L130 PetriNetUnfolder]: 10041/15076 cut-off events. [2023-08-31 23:30:44,850 INFO L131 PetriNetUnfolder]: For 13046/13112 co-relation queries the response was YES. [2023-08-31 23:30:44,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50826 conditions, 15076 events. 10041/15076 cut-off events. For 13046/13112 co-relation queries the response was YES. Maximal size of possible extension queue 1017. Compared 99154 event pairs, 3927 based on Foata normal form. 20/11732 useless extension candidates. Maximal degree in co-relation 50809. Up to 6589 conditions per place. [2023-08-31 23:30:44,911 INFO L137 encePairwiseOnDemand]: 300/315 looper letters, 79 selfloop transitions, 20 changer transitions 0/102 dead transitions. [2023-08-31 23:30:44,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 102 transitions, 746 flow [2023-08-31 23:30:44,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:30:44,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:30:44,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 524 transitions. [2023-08-31 23:30:44,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4158730158730159 [2023-08-31 23:30:44,913 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 524 transitions. [2023-08-31 23:30:44,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 524 transitions. [2023-08-31 23:30:44,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:44,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 524 transitions. [2023-08-31 23:30:44,914 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-31 23:30:44,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 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-31 23:30:44,915 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 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-31 23:30:44,915 INFO L175 Difference]: Start difference. First operand has 72 places, 73 transitions, 422 flow. Second operand 4 states and 524 transitions. [2023-08-31 23:30:44,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 102 transitions, 746 flow [2023-08-31 23:30:45,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 102 transitions, 736 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-31 23:30:45,006 INFO L231 Difference]: Finished difference. Result has 74 places, 78 transitions, 531 flow [2023-08-31 23:30:45,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=531, PETRI_PLACES=74, PETRI_TRANSITIONS=78} [2023-08-31 23:30:45,007 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -6 predicate places. [2023-08-31 23:30:45,007 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 78 transitions, 531 flow [2023-08-31 23:30:45,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 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-31 23:30:45,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:45,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:30:45,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:30:45,008 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:30:45,008 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:45,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1349055979, now seen corresponding path program 1 times [2023-08-31 23:30:45,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:30:45,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275029970] [2023-08-31 23:30:45,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:30:45,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:30:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:30:45,261 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-31 23:30:45,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:30:45,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275029970] [2023-08-31 23:30:45,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275029970] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:45,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:45,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:30:45,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964984141] [2023-08-31 23:30:45,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:45,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:30:45,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:30:45,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:30:45,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:30:45,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 315 [2023-08-31 23:30:45,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 78 transitions, 531 flow. Second operand has 6 states, 6 states have (on average 118.33333333333333) internal successors, (710), 6 states have internal predecessors, (710), 0 states have call successors, (0), 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-31 23:30:45,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:45,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 315 [2023-08-31 23:30:45,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:47,111 INFO L130 PetriNetUnfolder]: 12273/18936 cut-off events. [2023-08-31 23:30:47,111 INFO L131 PetriNetUnfolder]: For 22978/22993 co-relation queries the response was YES. [2023-08-31 23:30:47,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69774 conditions, 18936 events. 12273/18936 cut-off events. For 22978/22993 co-relation queries the response was YES. Maximal size of possible extension queue 1429. Compared 138334 event pairs, 3319 based on Foata normal form. 2/16064 useless extension candidates. Maximal degree in co-relation 69757. Up to 7632 conditions per place. [2023-08-31 23:30:47,217 INFO L137 encePairwiseOnDemand]: 308/315 looper letters, 187 selfloop transitions, 16 changer transitions 0/206 dead transitions. [2023-08-31 23:30:47,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 206 transitions, 1655 flow [2023-08-31 23:30:47,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:30:47,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:30:47,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1072 transitions. [2023-08-31 23:30:47,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4253968253968254 [2023-08-31 23:30:47,219 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1072 transitions. [2023-08-31 23:30:47,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1072 transitions. [2023-08-31 23:30:47,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:47,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1072 transitions. [2023-08-31 23:30:47,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 0 states have call successors, (0), 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-31 23:30:47,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 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-31 23:30:47,224 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 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-31 23:30:47,224 INFO L175 Difference]: Start difference. First operand has 74 places, 78 transitions, 531 flow. Second operand 8 states and 1072 transitions. [2023-08-31 23:30:47,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 206 transitions, 1655 flow [2023-08-31 23:30:47,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 206 transitions, 1640 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:30:47,537 INFO L231 Difference]: Finished difference. Result has 83 places, 79 transitions, 590 flow [2023-08-31 23:30:47,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=590, PETRI_PLACES=83, PETRI_TRANSITIONS=79} [2023-08-31 23:30:47,538 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 3 predicate places. [2023-08-31 23:30:47,538 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 590 flow [2023-08-31 23:30:47,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.33333333333333) internal successors, (710), 6 states have internal predecessors, (710), 0 states have call successors, (0), 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-31 23:30:47,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:47,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:30:47,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:30:47,538 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:30:47,539 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:47,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1816114094, now seen corresponding path program 1 times [2023-08-31 23:30:47,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:30:47,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173089221] [2023-08-31 23:30:47,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:30:47,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:30:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:30:47,620 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-31 23:30:47,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:30:47,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173089221] [2023-08-31 23:30:47,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173089221] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:47,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:47,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:30:47,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291892309] [2023-08-31 23:30:47,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:47,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:30:47,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:30:47,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:30:47,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:30:47,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 315 [2023-08-31 23:30:47,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 590 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 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-31 23:30:47,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:47,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 315 [2023-08-31 23:30:47,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:49,389 INFO L130 PetriNetUnfolder]: 12556/19533 cut-off events. [2023-08-31 23:30:49,390 INFO L131 PetriNetUnfolder]: For 33752/33785 co-relation queries the response was YES. [2023-08-31 23:30:49,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75738 conditions, 19533 events. 12556/19533 cut-off events. For 33752/33785 co-relation queries the response was YES. Maximal size of possible extension queue 1520. Compared 144211 event pairs, 4172 based on Foata normal form. 76/17509 useless extension candidates. Maximal degree in co-relation 75716. Up to 9287 conditions per place. [2023-08-31 23:30:49,512 INFO L137 encePairwiseOnDemand]: 305/315 looper letters, 68 selfloop transitions, 36 changer transitions 0/107 dead transitions. [2023-08-31 23:30:49,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 107 transitions, 927 flow [2023-08-31 23:30:49,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:30:49,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:30:49,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 539 transitions. [2023-08-31 23:30:49,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42777777777777776 [2023-08-31 23:30:49,514 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 539 transitions. [2023-08-31 23:30:49,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 539 transitions. [2023-08-31 23:30:49,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:49,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 539 transitions. [2023-08-31 23:30:49,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 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-31 23:30:49,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 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-31 23:30:49,516 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 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-31 23:30:49,517 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 590 flow. Second operand 4 states and 539 transitions. [2023-08-31 23:30:49,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 107 transitions, 927 flow [2023-08-31 23:30:49,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 107 transitions, 895 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-08-31 23:30:49,832 INFO L231 Difference]: Finished difference. Result has 79 places, 82 transitions, 667 flow [2023-08-31 23:30:49,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=667, PETRI_PLACES=79, PETRI_TRANSITIONS=82} [2023-08-31 23:30:49,832 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -1 predicate places. [2023-08-31 23:30:49,832 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 82 transitions, 667 flow [2023-08-31 23:30:49,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 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-31 23:30:49,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:49,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:30:49,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:30:49,833 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:30:49,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:49,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1818086776, now seen corresponding path program 1 times [2023-08-31 23:30:49,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:30:49,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849077409] [2023-08-31 23:30:49,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:30:49,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:30:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:30:49,934 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-31 23:30:49,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:30:49,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849077409] [2023-08-31 23:30:49,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849077409] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:49,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:49,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:30:49,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581910357] [2023-08-31 23:30:49,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:49,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:30:49,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:30:49,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:30:49,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:30:49,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 315 [2023-08-31 23:30:49,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 82 transitions, 667 flow. Second operand has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 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-31 23:30:49,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:49,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 315 [2023-08-31 23:30:49,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:54,197 INFO L130 PetriNetUnfolder]: 31049/49232 cut-off events. [2023-08-31 23:30:54,197 INFO L131 PetriNetUnfolder]: For 110426/110507 co-relation queries the response was YES. [2023-08-31 23:30:54,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199568 conditions, 49232 events. 31049/49232 cut-off events. For 110426/110507 co-relation queries the response was YES. Maximal size of possible extension queue 3831. Compared 420780 event pairs, 8280 based on Foata normal form. 264/43981 useless extension candidates. Maximal degree in co-relation 199550. Up to 17618 conditions per place. [2023-08-31 23:30:54,514 INFO L137 encePairwiseOnDemand]: 311/315 looper letters, 265 selfloop transitions, 6 changer transitions 0/272 dead transitions. [2023-08-31 23:30:54,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 272 transitions, 2842 flow [2023-08-31 23:30:54,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:30:54,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:30:54,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 701 transitions. [2023-08-31 23:30:54,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4450793650793651 [2023-08-31 23:30:54,516 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 701 transitions. [2023-08-31 23:30:54,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 701 transitions. [2023-08-31 23:30:54,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:54,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 701 transitions. [2023-08-31 23:30:54,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.2) internal successors, (701), 5 states have internal predecessors, (701), 0 states have call successors, (0), 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-31 23:30:54,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 315.0) internal successors, (1890), 6 states have internal predecessors, (1890), 0 states have call successors, (0), 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-31 23:30:54,519 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 315.0) internal successors, (1890), 6 states have internal predecessors, (1890), 0 states have call successors, (0), 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-31 23:30:54,519 INFO L175 Difference]: Start difference. First operand has 79 places, 82 transitions, 667 flow. Second operand 5 states and 701 transitions. [2023-08-31 23:30:54,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 272 transitions, 2842 flow [2023-08-31 23:30:55,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 272 transitions, 2686 flow, removed 16 selfloop flow, removed 1 redundant places. [2023-08-31 23:30:55,734 INFO L231 Difference]: Finished difference. Result has 86 places, 86 transitions, 675 flow [2023-08-31 23:30:55,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=675, PETRI_PLACES=86, PETRI_TRANSITIONS=86} [2023-08-31 23:30:55,734 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 6 predicate places. [2023-08-31 23:30:55,734 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 86 transitions, 675 flow [2023-08-31 23:30:55,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 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-31 23:30:55,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:55,735 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:30:55,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:30:55,735 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:30:55,735 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:55,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1741229332, now seen corresponding path program 2 times [2023-08-31 23:30:55,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:30:55,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876394939] [2023-08-31 23:30:55,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:30:55,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:30:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:30:55,846 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-31 23:30:55,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:30:55,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876394939] [2023-08-31 23:30:55,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876394939] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:55,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:55,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:30:55,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112890772] [2023-08-31 23:30:55,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:55,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:30:55,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:30:55,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:30:55,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:30:55,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 315 [2023-08-31 23:30:55,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 86 transitions, 675 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 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-31 23:30:55,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:55,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 315 [2023-08-31 23:30:55,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:04,557 INFO L130 PetriNetUnfolder]: 55930/86844 cut-off events. [2023-08-31 23:31:04,557 INFO L131 PetriNetUnfolder]: For 193327/193327 co-relation queries the response was YES. [2023-08-31 23:31:04,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354893 conditions, 86844 events. 55930/86844 cut-off events. For 193327/193327 co-relation queries the response was YES. Maximal size of possible extension queue 5713. Compared 748980 event pairs, 16063 based on Foata normal form. 216/77207 useless extension candidates. Maximal degree in co-relation 354872. Up to 32745 conditions per place. [2023-08-31 23:31:05,170 INFO L137 encePairwiseOnDemand]: 311/315 looper letters, 267 selfloop transitions, 8 changer transitions 0/275 dead transitions. [2023-08-31 23:31:05,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 275 transitions, 2747 flow [2023-08-31 23:31:05,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:31:05,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:31:05,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 703 transitions. [2023-08-31 23:31:05,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44634920634920633 [2023-08-31 23:31:05,172 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 703 transitions. [2023-08-31 23:31:05,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 703 transitions. [2023-08-31 23:31:05,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:05,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 703 transitions. [2023-08-31 23:31:05,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.6) internal successors, (703), 5 states have internal predecessors, (703), 0 states have call successors, (0), 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-31 23:31:05,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 315.0) internal successors, (1890), 6 states have internal predecessors, (1890), 0 states have call successors, (0), 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-31 23:31:05,176 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 315.0) internal successors, (1890), 6 states have internal predecessors, (1890), 0 states have call successors, (0), 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-31 23:31:05,176 INFO L175 Difference]: Start difference. First operand has 86 places, 86 transitions, 675 flow. Second operand 5 states and 703 transitions. [2023-08-31 23:31:05,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 275 transitions, 2747 flow [2023-08-31 23:31:08,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 275 transitions, 2743 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-31 23:31:08,089 INFO L231 Difference]: Finished difference. Result has 92 places, 89 transitions, 719 flow [2023-08-31 23:31:08,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=719, PETRI_PLACES=92, PETRI_TRANSITIONS=89} [2023-08-31 23:31:08,090 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 12 predicate places. [2023-08-31 23:31:08,090 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 89 transitions, 719 flow [2023-08-31 23:31:08,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 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-31 23:31:08,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:08,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:08,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:31:08,091 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:31:08,091 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:08,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1741168882, now seen corresponding path program 3 times [2023-08-31 23:31:08,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:08,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569387148] [2023-08-31 23:31:08,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:08,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:08,201 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-31 23:31:08,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:08,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569387148] [2023-08-31 23:31:08,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569387148] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:08,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:08,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:31:08,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692011594] [2023-08-31 23:31:08,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:08,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:31:08,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:08,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:31:08,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:31:08,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 315 [2023-08-31 23:31:08,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 89 transitions, 719 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 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-31 23:31:08,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:08,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 315 [2023-08-31 23:31:08,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:18,151 INFO L130 PetriNetUnfolder]: 65120/101348 cut-off events. [2023-08-31 23:31:18,151 INFO L131 PetriNetUnfolder]: For 247868/247868 co-relation queries the response was YES. [2023-08-31 23:31:18,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425141 conditions, 101348 events. 65120/101348 cut-off events. For 247868/247868 co-relation queries the response was YES. Maximal size of possible extension queue 6959. Compared 896208 event pairs, 19261 based on Foata normal form. 234/89945 useless extension candidates. Maximal degree in co-relation 425117. Up to 68924 conditions per place. [2023-08-31 23:31:18,956 INFO L137 encePairwiseOnDemand]: 310/315 looper letters, 186 selfloop transitions, 5 changer transitions 0/191 dead transitions. [2023-08-31 23:31:18,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 191 transitions, 1920 flow [2023-08-31 23:31:18,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:31:18,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:31:18,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 554 transitions. [2023-08-31 23:31:18,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4396825396825397 [2023-08-31 23:31:18,958 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 554 transitions. [2023-08-31 23:31:18,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 554 transitions. [2023-08-31 23:31:18,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:18,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 554 transitions. [2023-08-31 23:31:18,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 0 states have call successors, (0), 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-31 23:31:18,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 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-31 23:31:18,961 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 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-31 23:31:18,961 INFO L175 Difference]: Start difference. First operand has 92 places, 89 transitions, 719 flow. Second operand 4 states and 554 transitions. [2023-08-31 23:31:18,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 191 transitions, 1920 flow [2023-08-31 23:31:22,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 191 transitions, 1912 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-08-31 23:31:22,687 INFO L231 Difference]: Finished difference. Result has 96 places, 90 transitions, 736 flow [2023-08-31 23:31:22,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=736, PETRI_PLACES=96, PETRI_TRANSITIONS=90} [2023-08-31 23:31:22,688 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 16 predicate places. [2023-08-31 23:31:22,688 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 90 transitions, 736 flow [2023-08-31 23:31:22,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 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-31 23:31:22,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:22,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:22,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 23:31:22,688 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:31:22,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:22,689 INFO L85 PathProgramCache]: Analyzing trace with hash 132711279, now seen corresponding path program 1 times [2023-08-31 23:31:22,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:22,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922649687] [2023-08-31 23:31:22,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:22,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:23,018 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-31 23:31:23,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:23,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922649687] [2023-08-31 23:31:23,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922649687] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:23,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:23,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:31:23,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392587792] [2023-08-31 23:31:23,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:23,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:31:23,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:23,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:31:23,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:31:23,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 315 [2023-08-31 23:31:23,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 90 transitions, 736 flow. Second operand has 8 states, 8 states have (on average 108.875) internal successors, (871), 8 states have internal predecessors, (871), 0 states have call successors, (0), 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-31 23:31:23,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:23,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 315 [2023-08-31 23:31:23,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:29,481 INFO L130 PetriNetUnfolder]: 37235/60054 cut-off events. [2023-08-31 23:31:29,481 INFO L131 PetriNetUnfolder]: For 160143/160599 co-relation queries the response was YES. [2023-08-31 23:31:29,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237842 conditions, 60054 events. 37235/60054 cut-off events. For 160143/160599 co-relation queries the response was YES. Maximal size of possible extension queue 5337. Compared 545862 event pairs, 9223 based on Foata normal form. 84/57968 useless extension candidates. Maximal degree in co-relation 237816. Up to 22903 conditions per place. [2023-08-31 23:31:29,887 INFO L137 encePairwiseOnDemand]: 308/315 looper letters, 116 selfloop transitions, 27 changer transitions 1/152 dead transitions. [2023-08-31 23:31:29,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 152 transitions, 1426 flow [2023-08-31 23:31:29,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:31:29,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:31:29,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 830 transitions. [2023-08-31 23:31:29,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3764172335600907 [2023-08-31 23:31:29,891 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 830 transitions. [2023-08-31 23:31:29,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 830 transitions. [2023-08-31 23:31:29,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:29,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 830 transitions. [2023-08-31 23:31:29,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.57142857142857) internal successors, (830), 7 states have internal predecessors, (830), 0 states have call successors, (0), 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-31 23:31:29,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 315.0) internal successors, (2520), 8 states have internal predecessors, (2520), 0 states have call successors, (0), 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-31 23:31:29,894 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 315.0) internal successors, (2520), 8 states have internal predecessors, (2520), 0 states have call successors, (0), 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-31 23:31:29,894 INFO L175 Difference]: Start difference. First operand has 96 places, 90 transitions, 736 flow. Second operand 7 states and 830 transitions. [2023-08-31 23:31:29,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 152 transitions, 1426 flow [2023-08-31 23:31:31,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 152 transitions, 1415 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:31:31,170 INFO L231 Difference]: Finished difference. Result has 99 places, 81 transitions, 690 flow [2023-08-31 23:31:31,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=690, PETRI_PLACES=99, PETRI_TRANSITIONS=81} [2023-08-31 23:31:31,170 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 19 predicate places. [2023-08-31 23:31:31,171 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 81 transitions, 690 flow [2023-08-31 23:31:31,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.875) internal successors, (871), 8 states have internal predecessors, (871), 0 states have call successors, (0), 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-31 23:31:31,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:31,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:31,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-31 23:31:31,171 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:31:31,172 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:31,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1805396294, now seen corresponding path program 1 times [2023-08-31 23:31:31,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:31,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495481209] [2023-08-31 23:31:31,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:31,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:31,290 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-31 23:31:31,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:31,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495481209] [2023-08-31 23:31:31,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495481209] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:31,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:31,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:31:31,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768542060] [2023-08-31 23:31:31,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:31,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:31:31,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:31,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:31:31,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:31:31,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 315 [2023-08-31 23:31:31,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 81 transitions, 690 flow. Second operand has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 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-31 23:31:31,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:31,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 315 [2023-08-31 23:31:31,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:36,198 INFO L130 PetriNetUnfolder]: 27254/44793 cut-off events. [2023-08-31 23:31:36,198 INFO L131 PetriNetUnfolder]: For 117349/117801 co-relation queries the response was YES. [2023-08-31 23:31:36,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171903 conditions, 44793 events. 27254/44793 cut-off events. For 117349/117801 co-relation queries the response was YES. Maximal size of possible extension queue 3296. Compared 396826 event pairs, 12201 based on Foata normal form. 1459/44880 useless extension candidates. Maximal degree in co-relation 171877. Up to 18906 conditions per place. [2023-08-31 23:31:36,491 INFO L137 encePairwiseOnDemand]: 300/315 looper letters, 101 selfloop transitions, 21 changer transitions 1/131 dead transitions. [2023-08-31 23:31:36,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 131 transitions, 1274 flow [2023-08-31 23:31:36,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:31:36,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:31:36,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 745 transitions. [2023-08-31 23:31:36,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3941798941798942 [2023-08-31 23:31:36,492 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 745 transitions. [2023-08-31 23:31:36,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 745 transitions. [2023-08-31 23:31:36,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:36,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 745 transitions. [2023-08-31 23:31:36,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 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-31 23:31:36,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 315.0) internal successors, (2205), 7 states have internal predecessors, (2205), 0 states have call successors, (0), 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-31 23:31:36,496 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 315.0) internal successors, (2205), 7 states have internal predecessors, (2205), 0 states have call successors, (0), 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-31 23:31:36,496 INFO L175 Difference]: Start difference. First operand has 99 places, 81 transitions, 690 flow. Second operand 6 states and 745 transitions. [2023-08-31 23:31:36,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 131 transitions, 1274 flow [2023-08-31 23:31:37,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 131 transitions, 1220 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-31 23:31:37,308 INFO L231 Difference]: Finished difference. Result has 100 places, 86 transitions, 780 flow [2023-08-31 23:31:37,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=780, PETRI_PLACES=100, PETRI_TRANSITIONS=86} [2023-08-31 23:31:37,308 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 20 predicate places. [2023-08-31 23:31:37,308 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 86 transitions, 780 flow [2023-08-31 23:31:37,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 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-31 23:31:37,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:37,309 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:37,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-31 23:31:37,309 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:31:37,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:37,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1783372630, now seen corresponding path program 1 times [2023-08-31 23:31:37,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:37,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015985121] [2023-08-31 23:31:37,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:37,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:37,487 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-31 23:31:37,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:37,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015985121] [2023-08-31 23:31:37,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015985121] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:37,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:37,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:31:37,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305195377] [2023-08-31 23:31:37,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:37,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:31:37,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:37,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:31:37,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:31:37,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 315 [2023-08-31 23:31:37,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 86 transitions, 780 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-31 23:31:37,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:37,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 315 [2023-08-31 23:31:37,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:44,235 INFO L130 PetriNetUnfolder]: 37777/62479 cut-off events. [2023-08-31 23:31:44,235 INFO L131 PetriNetUnfolder]: For 219938/220137 co-relation queries the response was YES. [2023-08-31 23:31:44,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259836 conditions, 62479 events. 37777/62479 cut-off events. For 219938/220137 co-relation queries the response was YES. Maximal size of possible extension queue 3962. Compared 574122 event pairs, 13956 based on Foata normal form. 221/61555 useless extension candidates. Maximal degree in co-relation 259809. Up to 30735 conditions per place. [2023-08-31 23:31:44,671 INFO L137 encePairwiseOnDemand]: 310/315 looper letters, 172 selfloop transitions, 5 changer transitions 0/180 dead transitions. [2023-08-31 23:31:44,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 180 transitions, 2007 flow [2023-08-31 23:31:44,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:31:44,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:31:44,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 549 transitions. [2023-08-31 23:31:44,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4357142857142857 [2023-08-31 23:31:44,673 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 549 transitions. [2023-08-31 23:31:44,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 549 transitions. [2023-08-31 23:31:44,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:44,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 549 transitions. [2023-08-31 23:31:44,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 0 states have call successors, (0), 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-31 23:31:44,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 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-31 23:31:44,676 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 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-31 23:31:44,676 INFO L175 Difference]: Start difference. First operand has 100 places, 86 transitions, 780 flow. Second operand 4 states and 549 transitions. [2023-08-31 23:31:44,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 180 transitions, 2007 flow [2023-08-31 23:31:48,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 180 transitions, 1953 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:31:48,666 INFO L231 Difference]: Finished difference. Result has 101 places, 87 transitions, 782 flow [2023-08-31 23:31:48,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=782, PETRI_PLACES=101, PETRI_TRANSITIONS=87} [2023-08-31 23:31:48,666 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 21 predicate places. [2023-08-31 23:31:48,666 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 87 transitions, 782 flow [2023-08-31 23:31:48,667 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-31 23:31:48,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:48,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:48,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-31 23:31:48,667 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:31:48,667 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:48,667 INFO L85 PathProgramCache]: Analyzing trace with hash 279946760, now seen corresponding path program 2 times [2023-08-31 23:31:48,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:48,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144845463] [2023-08-31 23:31:48,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:48,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:49,394 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-31 23:31:49,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:49,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144845463] [2023-08-31 23:31:49,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144845463] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:49,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:49,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:31:49,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796374078] [2023-08-31 23:31:49,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:49,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:31:49,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:49,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:31:49,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:31:49,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 315 [2023-08-31 23:31:49,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 87 transitions, 782 flow. Second operand has 9 states, 9 states have (on average 106.55555555555556) internal successors, (959), 9 states have internal predecessors, (959), 0 states have call successors, (0), 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-31 23:31:49,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:49,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 315 [2023-08-31 23:31:49,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:31:56,115 INFO L130 PetriNetUnfolder]: 34340/56390 cut-off events. [2023-08-31 23:31:56,115 INFO L131 PetriNetUnfolder]: For 156520/157172 co-relation queries the response was YES. [2023-08-31 23:31:56,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231340 conditions, 56390 events. 34340/56390 cut-off events. For 156520/157172 co-relation queries the response was YES. Maximal size of possible extension queue 4227. Compared 518308 event pairs, 17041 based on Foata normal form. 87/54747 useless extension candidates. Maximal degree in co-relation 231311. Up to 53004 conditions per place. [2023-08-31 23:31:56,473 INFO L137 encePairwiseOnDemand]: 303/315 looper letters, 138 selfloop transitions, 55 changer transitions 0/201 dead transitions. [2023-08-31 23:31:56,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 201 transitions, 2074 flow [2023-08-31 23:31:56,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-31 23:31:56,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-31 23:31:56,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1264 transitions. [2023-08-31 23:31:56,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3647907647907648 [2023-08-31 23:31:56,475 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1264 transitions. [2023-08-31 23:31:56,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1264 transitions. [2023-08-31 23:31:56,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:31:56,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1264 transitions. [2023-08-31 23:31:56,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 114.9090909090909) internal successors, (1264), 11 states have internal predecessors, (1264), 0 states have call successors, (0), 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-31 23:31:56,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 315.0) internal successors, (3780), 12 states have internal predecessors, (3780), 0 states have call successors, (0), 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-31 23:31:56,481 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 315.0) internal successors, (3780), 12 states have internal predecessors, (3780), 0 states have call successors, (0), 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-31 23:31:56,481 INFO L175 Difference]: Start difference. First operand has 101 places, 87 transitions, 782 flow. Second operand 11 states and 1264 transitions. [2023-08-31 23:31:56,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 201 transitions, 2074 flow [2023-08-31 23:31:59,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 201 transitions, 2050 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:31:59,327 INFO L231 Difference]: Finished difference. Result has 118 places, 141 transitions, 1470 flow [2023-08-31 23:31:59,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1470, PETRI_PLACES=118, PETRI_TRANSITIONS=141} [2023-08-31 23:31:59,328 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 38 predicate places. [2023-08-31 23:31:59,328 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 141 transitions, 1470 flow [2023-08-31 23:31:59,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 106.55555555555556) internal successors, (959), 9 states have internal predecessors, (959), 0 states have call successors, (0), 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-31 23:31:59,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:31:59,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:31:59,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-31 23:31:59,329 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:31:59,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:31:59,329 INFO L85 PathProgramCache]: Analyzing trace with hash 132714388, now seen corresponding path program 1 times [2023-08-31 23:31:59,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:31:59,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495759915] [2023-08-31 23:31:59,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:31:59,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:31:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:31:59,372 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-31 23:31:59,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:31:59,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495759915] [2023-08-31 23:31:59,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495759915] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:31:59,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:31:59,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:31:59,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851826315] [2023-08-31 23:31:59,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:31:59,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:31:59,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:31:59,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:31:59,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:31:59,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 315 [2023-08-31 23:31:59,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 141 transitions, 1470 flow. Second operand has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 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-31 23:31:59,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:31:59,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 315 [2023-08-31 23:31:59,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:32:04,674 INFO L130 PetriNetUnfolder]: 28232/43327 cut-off events. [2023-08-31 23:32:04,674 INFO L131 PetriNetUnfolder]: For 179942/180896 co-relation queries the response was YES. [2023-08-31 23:32:04,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186918 conditions, 43327 events. 28232/43327 cut-off events. For 179942/180896 co-relation queries the response was YES. Maximal size of possible extension queue 2514. Compared 340899 event pairs, 14380 based on Foata normal form. 1769/44329 useless extension candidates. Maximal degree in co-relation 186880. Up to 35409 conditions per place. [2023-08-31 23:32:04,939 INFO L137 encePairwiseOnDemand]: 300/315 looper letters, 47 selfloop transitions, 1 changer transitions 94/145 dead transitions. [2023-08-31 23:32:04,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 145 transitions, 1759 flow [2023-08-31 23:32:04,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:32:04,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:32:04,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 508 transitions. [2023-08-31 23:32:04,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4031746031746032 [2023-08-31 23:32:04,941 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 508 transitions. [2023-08-31 23:32:04,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 508 transitions. [2023-08-31 23:32:04,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:32:04,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 508 transitions. [2023-08-31 23:32:04,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 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-31 23:32:04,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 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-31 23:32:04,943 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 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-31 23:32:04,943 INFO L175 Difference]: Start difference. First operand has 118 places, 141 transitions, 1470 flow. Second operand 4 states and 508 transitions. [2023-08-31 23:32:04,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 145 transitions, 1759 flow [2023-08-31 23:32:07,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 145 transitions, 1650 flow, removed 21 selfloop flow, removed 5 redundant places. [2023-08-31 23:32:07,593 INFO L231 Difference]: Finished difference. Result has 109 places, 51 transitions, 397 flow [2023-08-31 23:32:07,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=397, PETRI_PLACES=109, PETRI_TRANSITIONS=51} [2023-08-31 23:32:07,593 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 29 predicate places. [2023-08-31 23:32:07,593 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 51 transitions, 397 flow [2023-08-31 23:32:07,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 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-31 23:32:07,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:32:07,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:32:07,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-31 23:32:07,594 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:32:07,594 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:32:07,594 INFO L85 PathProgramCache]: Analyzing trace with hash 210091800, now seen corresponding path program 1 times [2023-08-31 23:32:07,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:32:07,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123599075] [2023-08-31 23:32:07,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:32:07,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:32:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:32:08,619 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-31 23:32:08,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:32:08,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123599075] [2023-08-31 23:32:08,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123599075] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:32:08,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:32:08,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:32:08,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309705951] [2023-08-31 23:32:08,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:32:08,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:32:08,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:32:08,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:32:08,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:32:08,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 315 [2023-08-31 23:32:08,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 51 transitions, 397 flow. Second operand has 9 states, 9 states have (on average 108.66666666666667) internal successors, (978), 9 states have internal predecessors, (978), 0 states have call successors, (0), 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-31 23:32:08,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:32:08,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 315 [2023-08-31 23:32:08,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:32:09,469 INFO L130 PetriNetUnfolder]: 2548/4098 cut-off events. [2023-08-31 23:32:09,469 INFO L131 PetriNetUnfolder]: For 19322/19407 co-relation queries the response was YES. [2023-08-31 23:32:09,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14740 conditions, 4098 events. 2548/4098 cut-off events. For 19322/19407 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 24049 event pairs, 1043 based on Foata normal form. 104/4170 useless extension candidates. Maximal degree in co-relation 14706. Up to 2883 conditions per place. [2023-08-31 23:32:09,483 INFO L137 encePairwiseOnDemand]: 305/315 looper letters, 56 selfloop transitions, 26 changer transitions 1/86 dead transitions. [2023-08-31 23:32:09,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 86 transitions, 764 flow [2023-08-31 23:32:09,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:32:09,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:32:09,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 920 transitions. [2023-08-31 23:32:09,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36507936507936506 [2023-08-31 23:32:09,485 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 920 transitions. [2023-08-31 23:32:09,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 920 transitions. [2023-08-31 23:32:09,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:32:09,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 920 transitions. [2023-08-31 23:32:09,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 115.0) internal successors, (920), 8 states have internal predecessors, (920), 0 states have call successors, (0), 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-31 23:32:09,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 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-31 23:32:09,489 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 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-31 23:32:09,489 INFO L175 Difference]: Start difference. First operand has 109 places, 51 transitions, 397 flow. Second operand 8 states and 920 transitions. [2023-08-31 23:32:09,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 86 transitions, 764 flow [2023-08-31 23:32:09,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 86 transitions, 638 flow, removed 17 selfloop flow, removed 20 redundant places. [2023-08-31 23:32:09,501 INFO L231 Difference]: Finished difference. Result has 81 places, 58 transitions, 452 flow [2023-08-31 23:32:09,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=452, PETRI_PLACES=81, PETRI_TRANSITIONS=58} [2023-08-31 23:32:09,501 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 1 predicate places. [2023-08-31 23:32:09,501 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 58 transitions, 452 flow [2023-08-31 23:32:09,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 108.66666666666667) internal successors, (978), 9 states have internal predecessors, (978), 0 states have call successors, (0), 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-31 23:32:09,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:32:09,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:32:09,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-31 23:32:09,502 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:32:09,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:32:09,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1542566286, now seen corresponding path program 1 times [2023-08-31 23:32:09,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:32:09,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359925630] [2023-08-31 23:32:09,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:32:09,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:32:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:32:09,627 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-31 23:32:09,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:32:09,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359925630] [2023-08-31 23:32:09,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359925630] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:32:09,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:32:09,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:32:09,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565165508] [2023-08-31 23:32:09,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:32:09,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:32:09,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:32:09,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:32:09,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:32:09,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 315 [2023-08-31 23:32:09,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 58 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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-31 23:32:09,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:32:09,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 315 [2023-08-31 23:32:09,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:32:10,059 INFO L130 PetriNetUnfolder]: 2535/4202 cut-off events. [2023-08-31 23:32:10,059 INFO L131 PetriNetUnfolder]: For 13313/13313 co-relation queries the response was YES. [2023-08-31 23:32:10,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15465 conditions, 4202 events. 2535/4202 cut-off events. For 13313/13313 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 24945 event pairs, 989 based on Foata normal form. 107/4309 useless extension candidates. Maximal degree in co-relation 15441. Up to 2217 conditions per place. [2023-08-31 23:32:10,074 INFO L137 encePairwiseOnDemand]: 312/315 looper letters, 46 selfloop transitions, 2 changer transitions 43/92 dead transitions. [2023-08-31 23:32:10,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 92 transitions, 891 flow [2023-08-31 23:32:10,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:32:10,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:32:10,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2023-08-31 23:32:10,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41904761904761906 [2023-08-31 23:32:10,075 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2023-08-31 23:32:10,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2023-08-31 23:32:10,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:32:10,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2023-08-31 23:32:10,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 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-31 23:32:10,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 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-31 23:32:10,077 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 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-31 23:32:10,077 INFO L175 Difference]: Start difference. First operand has 81 places, 58 transitions, 452 flow. Second operand 3 states and 396 transitions. [2023-08-31 23:32:10,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 92 transitions, 891 flow [2023-08-31 23:32:10,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 92 transitions, 839 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-08-31 23:32:10,091 INFO L231 Difference]: Finished difference. Result has 79 places, 38 transitions, 264 flow [2023-08-31 23:32:10,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=79, PETRI_TRANSITIONS=38} [2023-08-31 23:32:10,092 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -1 predicate places. [2023-08-31 23:32:10,092 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 38 transitions, 264 flow [2023-08-31 23:32:10,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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-31 23:32:10,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:32:10,092 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-31 23:32:10,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-31 23:32:10,093 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:32:10,093 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:32:10,093 INFO L85 PathProgramCache]: Analyzing trace with hash 724810655, now seen corresponding path program 1 times [2023-08-31 23:32:10,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:32:10,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119548340] [2023-08-31 23:32:10,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:32:10,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:32:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:32:10,266 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-31 23:32:10,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:32:10,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119548340] [2023-08-31 23:32:10,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119548340] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:32:10,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:32:10,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:32:10,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311054883] [2023-08-31 23:32:10,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:32:10,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:32:10,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:32:10,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:32:10,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:32:10,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 315 [2023-08-31 23:32:10,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 38 transitions, 264 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-31 23:32:10,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:32:10,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 315 [2023-08-31 23:32:10,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:32:10,487 INFO L130 PetriNetUnfolder]: 848/1507 cut-off events. [2023-08-31 23:32:10,488 INFO L131 PetriNetUnfolder]: For 4860/4860 co-relation queries the response was YES. [2023-08-31 23:32:10,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5582 conditions, 1507 events. 848/1507 cut-off events. For 4860/4860 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8112 event pairs, 156 based on Foata normal form. 169/1668 useless extension candidates. Maximal degree in co-relation 5558. Up to 892 conditions per place. [2023-08-31 23:32:10,493 INFO L137 encePairwiseOnDemand]: 309/315 looper letters, 48 selfloop transitions, 4 changer transitions 35/89 dead transitions. [2023-08-31 23:32:10,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 89 transitions, 789 flow [2023-08-31 23:32:10,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:32:10,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:32:10,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 645 transitions. [2023-08-31 23:32:10,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2023-08-31 23:32:10,495 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 645 transitions. [2023-08-31 23:32:10,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 645 transitions. [2023-08-31 23:32:10,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:32:10,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 645 transitions. [2023-08-31 23:32:10,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 0 states have call successors, (0), 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-31 23:32:10,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 315.0) internal successors, (1890), 6 states have internal predecessors, (1890), 0 states have call successors, (0), 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-31 23:32:10,497 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 315.0) internal successors, (1890), 6 states have internal predecessors, (1890), 0 states have call successors, (0), 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-31 23:32:10,497 INFO L175 Difference]: Start difference. First operand has 79 places, 38 transitions, 264 flow. Second operand 5 states and 645 transitions. [2023-08-31 23:32:10,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 89 transitions, 789 flow [2023-08-31 23:32:10,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 89 transitions, 724 flow, removed 5 selfloop flow, removed 11 redundant places. [2023-08-31 23:32:10,502 INFO L231 Difference]: Finished difference. Result has 73 places, 41 transitions, 266 flow [2023-08-31 23:32:10,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=266, PETRI_PLACES=73, PETRI_TRANSITIONS=41} [2023-08-31 23:32:10,502 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -7 predicate places. [2023-08-31 23:32:10,502 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 41 transitions, 266 flow [2023-08-31 23:32:10,502 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-31 23:32:10,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:32:10,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:32:10,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-31 23:32:10,503 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:32:10,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:32:10,503 INFO L85 PathProgramCache]: Analyzing trace with hash -673365644, now seen corresponding path program 1 times [2023-08-31 23:32:10,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:32:10,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998932136] [2023-08-31 23:32:10,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:32:10,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:32:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:32:11,849 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-31 23:32:11,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:32:11,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998932136] [2023-08-31 23:32:11,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998932136] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:32:11,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:32:11,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-31 23:32:11,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261238774] [2023-08-31 23:32:11,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:32:11,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-31 23:32:11,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:32:11,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-31 23:32:11,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-08-31 23:32:12,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 315 [2023-08-31 23:32:12,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 41 transitions, 266 flow. Second operand has 11 states, 11 states have (on average 107.54545454545455) internal successors, (1183), 11 states have internal predecessors, (1183), 0 states have call successors, (0), 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-31 23:32:12,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:32:12,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 315 [2023-08-31 23:32:12,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:32:12,543 INFO L130 PetriNetUnfolder]: 623/1123 cut-off events. [2023-08-31 23:32:12,543 INFO L131 PetriNetUnfolder]: For 2816/2822 co-relation queries the response was YES. [2023-08-31 23:32:12,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4827 conditions, 1123 events. 623/1123 cut-off events. For 2816/2822 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5469 event pairs, 212 based on Foata normal form. 8/1125 useless extension candidates. Maximal degree in co-relation 4807. Up to 1035 conditions per place. [2023-08-31 23:32:12,546 INFO L137 encePairwiseOnDemand]: 305/315 looper letters, 35 selfloop transitions, 15 changer transitions 3/55 dead transitions. [2023-08-31 23:32:12,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 55 transitions, 442 flow [2023-08-31 23:32:12,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:32:12,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:32:12,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 892 transitions. [2023-08-31 23:32:12,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.353968253968254 [2023-08-31 23:32:12,550 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 892 transitions. [2023-08-31 23:32:12,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 892 transitions. [2023-08-31 23:32:12,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:32:12,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 892 transitions. [2023-08-31 23:32:12,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 111.5) internal successors, (892), 8 states have internal predecessors, (892), 0 states have call successors, (0), 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-31 23:32:12,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 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-31 23:32:12,553 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 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-31 23:32:12,553 INFO L175 Difference]: Start difference. First operand has 73 places, 41 transitions, 266 flow. Second operand 8 states and 892 transitions. [2023-08-31 23:32:12,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 55 transitions, 442 flow [2023-08-31 23:32:12,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 55 transitions, 433 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-31 23:32:12,556 INFO L231 Difference]: Finished difference. Result has 77 places, 43 transitions, 320 flow [2023-08-31 23:32:12,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=320, PETRI_PLACES=77, PETRI_TRANSITIONS=43} [2023-08-31 23:32:12,557 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -3 predicate places. [2023-08-31 23:32:12,557 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 43 transitions, 320 flow [2023-08-31 23:32:12,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 107.54545454545455) internal successors, (1183), 11 states have internal predecessors, (1183), 0 states have call successors, (0), 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-31 23:32:12,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:32:12,557 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:32:12,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-31 23:32:12,557 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:32:12,557 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:32:12,558 INFO L85 PathProgramCache]: Analyzing trace with hash -434728941, now seen corresponding path program 1 times [2023-08-31 23:32:12,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:32:12,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458369616] [2023-08-31 23:32:12,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:32:12,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:32:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:32:12,720 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-31 23:32:12,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:32:12,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458369616] [2023-08-31 23:32:12,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458369616] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:32:12,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:32:12,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:32:12,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23785143] [2023-08-31 23:32:12,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:32:12,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:32:12,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:32:12,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:32:12,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:32:12,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 315 [2023-08-31 23:32:12,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 43 transitions, 320 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-31 23:32:12,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:32:12,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 315 [2023-08-31 23:32:12,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:32:12,882 INFO L130 PetriNetUnfolder]: 431/847 cut-off events. [2023-08-31 23:32:12,883 INFO L131 PetriNetUnfolder]: For 2526/2526 co-relation queries the response was YES. [2023-08-31 23:32:12,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3707 conditions, 847 events. 431/847 cut-off events. For 2526/2526 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4285 event pairs, 54 based on Foata normal form. 98/943 useless extension candidates. Maximal degree in co-relation 3687. Up to 329 conditions per place. [2023-08-31 23:32:12,886 INFO L137 encePairwiseOnDemand]: 309/315 looper letters, 59 selfloop transitions, 7 changer transitions 28/96 dead transitions. [2023-08-31 23:32:12,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 96 transitions, 917 flow [2023-08-31 23:32:12,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:32:12,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:32:12,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 771 transitions. [2023-08-31 23:32:12,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40793650793650793 [2023-08-31 23:32:12,887 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 771 transitions. [2023-08-31 23:32:12,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 771 transitions. [2023-08-31 23:32:12,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:32:12,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 771 transitions. [2023-08-31 23:32:12,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.5) internal successors, (771), 6 states have internal predecessors, (771), 0 states have call successors, (0), 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-31 23:32:12,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 315.0) internal successors, (2205), 7 states have internal predecessors, (2205), 0 states have call successors, (0), 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-31 23:32:12,890 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 315.0) internal successors, (2205), 7 states have internal predecessors, (2205), 0 states have call successors, (0), 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-31 23:32:12,890 INFO L175 Difference]: Start difference. First operand has 77 places, 43 transitions, 320 flow. Second operand 6 states and 771 transitions. [2023-08-31 23:32:12,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 96 transitions, 917 flow [2023-08-31 23:32:12,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 96 transitions, 877 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-08-31 23:32:12,894 INFO L231 Difference]: Finished difference. Result has 79 places, 46 transitions, 348 flow [2023-08-31 23:32:12,894 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=348, PETRI_PLACES=79, PETRI_TRANSITIONS=46} [2023-08-31 23:32:12,894 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -1 predicate places. [2023-08-31 23:32:12,895 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 46 transitions, 348 flow [2023-08-31 23:32:12,895 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-31 23:32:12,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:32:12,896 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-31 23:32:12,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-31 23:32:12,896 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:32:12,896 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:32:12,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1019572303, now seen corresponding path program 1 times [2023-08-31 23:32:12,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:32:12,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442371720] [2023-08-31 23:32:12,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:32:12,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:32:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:32:13,111 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-31 23:32:13,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:32:13,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442371720] [2023-08-31 23:32:13,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442371720] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:32:13,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:32:13,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:32:13,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329610161] [2023-08-31 23:32:13,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:32:13,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:32:13,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:32:13,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:32:13,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:32:13,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 315 [2023-08-31 23:32:13,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 46 transitions, 348 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-31 23:32:13,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:32:13,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 315 [2023-08-31 23:32:13,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:32:13,261 INFO L130 PetriNetUnfolder]: 279/565 cut-off events. [2023-08-31 23:32:13,262 INFO L131 PetriNetUnfolder]: For 1943/1945 co-relation queries the response was YES. [2023-08-31 23:32:13,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2678 conditions, 565 events. 279/565 cut-off events. For 1943/1945 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2631 event pairs, 48 based on Foata normal form. 24/588 useless extension candidates. Maximal degree in co-relation 2655. Up to 233 conditions per place. [2023-08-31 23:32:13,264 INFO L137 encePairwiseOnDemand]: 309/315 looper letters, 56 selfloop transitions, 10 changer transitions 13/81 dead transitions. [2023-08-31 23:32:13,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 81 transitions, 787 flow [2023-08-31 23:32:13,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:32:13,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:32:13,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 880 transitions. [2023-08-31 23:32:13,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39909297052154197 [2023-08-31 23:32:13,266 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 880 transitions. [2023-08-31 23:32:13,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 880 transitions. [2023-08-31 23:32:13,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:32:13,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 880 transitions. [2023-08-31 23:32:13,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.71428571428571) internal successors, (880), 7 states have internal predecessors, (880), 0 states have call successors, (0), 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-31 23:32:13,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 315.0) internal successors, (2520), 8 states have internal predecessors, (2520), 0 states have call successors, (0), 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-31 23:32:13,270 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 315.0) internal successors, (2520), 8 states have internal predecessors, (2520), 0 states have call successors, (0), 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-31 23:32:13,270 INFO L175 Difference]: Start difference. First operand has 79 places, 46 transitions, 348 flow. Second operand 7 states and 880 transitions. [2023-08-31 23:32:13,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 81 transitions, 787 flow [2023-08-31 23:32:13,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 81 transitions, 721 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-08-31 23:32:13,274 INFO L231 Difference]: Finished difference. Result has 79 places, 46 transitions, 330 flow [2023-08-31 23:32:13,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=330, PETRI_PLACES=79, PETRI_TRANSITIONS=46} [2023-08-31 23:32:13,274 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -1 predicate places. [2023-08-31 23:32:13,274 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 46 transitions, 330 flow [2023-08-31 23:32:13,275 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-31 23:32:13,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:32:13,275 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] [2023-08-31 23:32:13,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-31 23:32:13,275 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:32:13,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:32:13,275 INFO L85 PathProgramCache]: Analyzing trace with hash -441206942, now seen corresponding path program 1 times [2023-08-31 23:32:13,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:32:13,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504824089] [2023-08-31 23:32:13,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:32:13,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:32:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:32:13,337 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:32:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:32:13,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:32:13,420 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:32:13,420 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (74 of 75 remaining) [2023-08-31 23:32:13,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (73 of 75 remaining) [2023-08-31 23:32:13,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 75 remaining) [2023-08-31 23:32:13,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 75 remaining) [2023-08-31 23:32:13,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 75 remaining) [2023-08-31 23:32:13,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 75 remaining) [2023-08-31 23:32:13,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 75 remaining) [2023-08-31 23:32:13,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 75 remaining) [2023-08-31 23:32:13,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 75 remaining) [2023-08-31 23:32:13,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 75 remaining) [2023-08-31 23:32:13,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 75 remaining) [2023-08-31 23:32:13,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 75 remaining) [2023-08-31 23:32:13,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 75 remaining) [2023-08-31 23:32:13,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 75 remaining) [2023-08-31 23:32:13,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 75 remaining) [2023-08-31 23:32:13,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 75 remaining) [2023-08-31 23:32:13,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 75 remaining) [2023-08-31 23:32:13,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 75 remaining) [2023-08-31 23:32:13,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 75 remaining) [2023-08-31 23:32:13,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 75 remaining) [2023-08-31 23:32:13,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 75 remaining) [2023-08-31 23:32:13,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 75 remaining) [2023-08-31 23:32:13,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 75 remaining) [2023-08-31 23:32:13,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 75 remaining) [2023-08-31 23:32:13,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 75 remaining) [2023-08-31 23:32:13,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 75 remaining) [2023-08-31 23:32:13,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 75 remaining) [2023-08-31 23:32:13,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 75 remaining) [2023-08-31 23:32:13,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 75 remaining) [2023-08-31 23:32:13,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 75 remaining) [2023-08-31 23:32:13,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 75 remaining) [2023-08-31 23:32:13,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 75 remaining) [2023-08-31 23:32:13,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 75 remaining) [2023-08-31 23:32:13,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 75 remaining) [2023-08-31 23:32:13,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 75 remaining) [2023-08-31 23:32:13,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 75 remaining) [2023-08-31 23:32:13,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 75 remaining) [2023-08-31 23:32:13,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 75 remaining) [2023-08-31 23:32:13,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 75 remaining) [2023-08-31 23:32:13,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 75 remaining) [2023-08-31 23:32:13,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 75 remaining) [2023-08-31 23:32:13,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 75 remaining) [2023-08-31 23:32:13,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (32 of 75 remaining) [2023-08-31 23:32:13,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 75 remaining) [2023-08-31 23:32:13,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 75 remaining) [2023-08-31 23:32:13,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 75 remaining) [2023-08-31 23:32:13,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (28 of 75 remaining) [2023-08-31 23:32:13,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 75 remaining) [2023-08-31 23:32:13,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 75 remaining) [2023-08-31 23:32:13,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 75 remaining) [2023-08-31 23:32:13,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 75 remaining) [2023-08-31 23:32:13,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 75 remaining) [2023-08-31 23:32:13,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 75 remaining) [2023-08-31 23:32:13,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 75 remaining) [2023-08-31 23:32:13,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 75 remaining) [2023-08-31 23:32:13,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 75 remaining) [2023-08-31 23:32:13,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 75 remaining) [2023-08-31 23:32:13,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 75 remaining) [2023-08-31 23:32:13,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 75 remaining) [2023-08-31 23:32:13,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 75 remaining) [2023-08-31 23:32:13,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 75 remaining) [2023-08-31 23:32:13,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 75 remaining) [2023-08-31 23:32:13,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 75 remaining) [2023-08-31 23:32:13,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 75 remaining) [2023-08-31 23:32:13,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 75 remaining) [2023-08-31 23:32:13,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 75 remaining) [2023-08-31 23:32:13,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 75 remaining) [2023-08-31 23:32:13,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 75 remaining) [2023-08-31 23:32:13,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 75 remaining) [2023-08-31 23:32:13,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 75 remaining) [2023-08-31 23:32:13,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 75 remaining) [2023-08-31 23:32:13,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 75 remaining) [2023-08-31 23:32:13,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 75 remaining) [2023-08-31 23:32:13,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 75 remaining) [2023-08-31 23:32:13,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 75 remaining) [2023-08-31 23:32:13,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-31 23:32:13,431 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:32:13,435 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:32:13,435 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:32:13,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:32:13 BasicIcfg [2023-08-31 23:32:13,490 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:32:13,490 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:32:13,490 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:32:13,490 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:32:13,491 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:30:12" (3/4) ... [2023-08-31 23:32:13,492 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:32:13,493 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:32:13,493 INFO L158 Benchmark]: Toolchain (without parser) took 122071.98ms. Allocated memory was 67.1MB in the beginning and 12.5GB in the end (delta: 12.4GB). Free memory was 37.9MB in the beginning and 7.2GB in the end (delta: -7.1GB). Peak memory consumption was 5.3GB. Max. memory is 16.1GB. [2023-08-31 23:32:13,493 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 67.1MB. Free memory is still 45.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:32:13,493 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.66ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 37.6MB in the beginning and 49.1MB in the end (delta: -11.4MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2023-08-31 23:32:13,494 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.30ms. Allocated memory is still 81.8MB. Free memory was 49.1MB in the beginning and 46.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:32:13,494 INFO L158 Benchmark]: Boogie Preprocessor took 57.48ms. Allocated memory is still 81.8MB. Free memory was 46.4MB in the beginning and 43.9MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 23:32:13,494 INFO L158 Benchmark]: RCFGBuilder took 1000.97ms. Allocated memory was 81.8MB in the beginning and 100.7MB in the end (delta: 18.9MB). Free memory was 43.9MB in the beginning and 70.4MB in the end (delta: -26.5MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2023-08-31 23:32:13,495 INFO L158 Benchmark]: TraceAbstraction took 120550.32ms. Allocated memory was 100.7MB in the beginning and 12.5GB in the end (delta: 12.4GB). Free memory was 69.6MB in the beginning and 7.2GB in the end (delta: -7.1GB). Peak memory consumption was 5.3GB. Max. memory is 16.1GB. [2023-08-31 23:32:13,495 INFO L158 Benchmark]: Witness Printer took 2.48ms. Allocated memory is still 12.5GB. Free memory is still 7.2GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:32:13,498 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.14ms. Allocated memory is still 67.1MB. Free memory is still 45.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 401.66ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 37.6MB in the beginning and 49.1MB in the end (delta: -11.4MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.30ms. Allocated memory is still 81.8MB. Free memory was 49.1MB in the beginning and 46.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.48ms. Allocated memory is still 81.8MB. Free memory was 46.4MB in the beginning and 43.9MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1000.97ms. Allocated memory was 81.8MB in the beginning and 100.7MB in the end (delta: 18.9MB). Free memory was 43.9MB in the beginning and 70.4MB in the end (delta: -26.5MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. * TraceAbstraction took 120550.32ms. Allocated memory was 100.7MB in the beginning and 12.5GB in the end (delta: 12.4GB). Free memory was 69.6MB in the beginning and 7.2GB in the end (delta: -7.1GB). Peak memory consumption was 5.3GB. Max. memory is 16.1GB. * Witness Printer took 2.48ms. Allocated memory is still 12.5GB. Free memory is still 7.2GB. 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: 10.0s, 176 PlacesBefore, 80 PlacesAfterwards, 168 TransitionsBefore, 71 TransitionsAfterwards, 6224 CoEnabledTransitionPairs, 8 FixpointIterations, 64 TrivialSequentialCompositions, 74 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 144 TotalNumberOfCompositions, 34669 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9371, independent: 8735, independent conditional: 0, independent unconditional: 8735, dependent: 636, dependent conditional: 0, dependent unconditional: 636, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2783, independent: 2681, independent conditional: 0, independent unconditional: 2681, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9371, independent: 6054, independent conditional: 0, independent unconditional: 6054, dependent: 534, dependent conditional: 0, dependent unconditional: 534, unknown: 2783, unknown conditional: 0, unknown unconditional: 2783] , Statistics on independence cache: Total cache size (in pairs): 541, Positive cache size: 487, Positive conditional cache size: 0, Positive unconditional cache size: 487, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L712] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L713] 0 int __unbuffered_p1_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L722] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L723] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L724] 0 int __unbuffered_p1_EAX$w_buff0; [L725] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L726] 0 int __unbuffered_p1_EAX$w_buff1; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L729] 0 int __unbuffered_p2_EAX = 0; [L731] 0 int __unbuffered_p2_EBX = 0; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L736] 0 _Bool x$flush_delayed; [L737] 0 int x$mem_tmp; [L738] 0 _Bool x$r_buff0_thd0; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L741] 0 _Bool x$r_buff0_thd3; [L742] 0 _Bool x$r_buff1_thd0; [L743] 0 _Bool x$r_buff1_thd1; [L744] 0 _Bool x$r_buff1_thd2; [L745] 0 _Bool x$r_buff1_thd3; [L746] 0 _Bool x$read_delayed; [L747] 0 int *x$read_delayed_var; [L748] 0 int x$w_buff0; [L749] 0 _Bool x$w_buff0_used; [L750] 0 int x$w_buff1; [L751] 0 _Bool x$w_buff1_used; [L753] 0 int y = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1852; [L854] FCALL, FORK 0 pthread_create(&t1852, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1852, ((void *)0), P0, ((void *)0))=-3, t1852={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L855] 0 pthread_t t1853; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1852={7:0}, t1853={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L856] FCALL, FORK 0 pthread_create(&t1853, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1853, ((void *)0), P1, ((void *)0))=-2, t1852={7:0}, t1853={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] EXPR 2 \read(x) [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L857] 0 pthread_t t1854; [L808] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L858] FCALL, FORK 0 pthread_create(&t1854, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1854, ((void *)0), P2, ((void *)0))=-1, t1852={7:0}, t1853={5:0}, t1854={6:0}, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L825] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L828] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L760] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L767] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L767] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1852={7:0}, t1853={5:0}, t1854={6:0}, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L875] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -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: -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: -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: -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: -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: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, 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: 854]: 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: 856]: 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 7 procedures, 226 locations, 75 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: 120.4s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 103.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2722 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2182 mSDsluCounter, 1022 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 821 mSDsCounter, 364 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5708 IncrementalHoareTripleChecker+Invalid, 6072 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 364 mSolverCounterUnsat, 201 mSDtfsCounter, 5708 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1470occurred in iteration=19, InterpolantAutomatonStates: 133, 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, 5.7s InterpolantComputationTime, 367 NumberOfCodeBlocks, 367 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 2775 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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-31 23:32:13,529 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/safe003_power.opt.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 91a9aa2f0d12b9c007fce98740577392f81daf83caae08bbaade32d740f10d38 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:32:15,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:32:15,748 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:32:15,772 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:32:15,774 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:32:15,777 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:32:15,779 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:32:15,781 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:32:15,782 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:32:15,785 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:32:15,786 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:32:15,788 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:32:15,788 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:32:15,789 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:32:15,791 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:32:15,794 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:32:15,794 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:32:15,795 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:32:15,796 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:32:15,800 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:32:15,801 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:32:15,802 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:32:15,802 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:32:15,803 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:32:15,807 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:32:15,807 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:32:15,808 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:32:15,809 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:32:15,809 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:32:15,810 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:32:15,810 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:32:15,811 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:32:15,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:32:15,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:32:15,813 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:32:15,814 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:32:15,814 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:32:15,814 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:32:15,814 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:32:15,815 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:32:15,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:32:15,823 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-31 23:32:15,847 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:32:15,848 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:32:15,848 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:32:15,849 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:32:15,849 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:32:15,849 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:32:15,850 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:32:15,850 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:32:15,850 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:32:15,850 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:32:15,851 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:32:15,851 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:32:15,851 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:32:15,851 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:32:15,851 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:32:15,851 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:32:15,852 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:32:15,852 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:32:15,852 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:32:15,852 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:32:15,852 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:32:15,852 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:32:15,852 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:32:15,853 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:32:15,853 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:32:15,853 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:32:15,853 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:32:15,853 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:32:15,853 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:32:15,854 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:32:15,854 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:32:15,854 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:32:15,854 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:32:15,854 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:32:15,854 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:32:15,854 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:32:15,855 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:32:15,855 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 -> 91a9aa2f0d12b9c007fce98740577392f81daf83caae08bbaade32d740f10d38 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 -> BEFORE [2023-08-31 23:32:16,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:32:16,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:32:16,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:32:16,076 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:32:16,077 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:32:16,078 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe003_power.opt.i [2023-08-31 23:32:17,074 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:32:17,262 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:32:17,262 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_power.opt.i [2023-08-31 23:32:17,272 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/046ffdc72/48d853c01948425eb734d56c66711013/FLAGec1fbb0a4 [2023-08-31 23:32:17,282 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/046ffdc72/48d853c01948425eb734d56c66711013 [2023-08-31 23:32:17,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:32:17,285 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:32:17,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:32:17,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:32:17,292 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:32:17,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:32:17" (1/1) ... [2023-08-31 23:32:17,293 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b74f60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:32:17, skipping insertion in model container [2023-08-31 23:32:17,294 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:32:17" (1/1) ... [2023-08-31 23:32:17,297 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:32:17,328 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:32:17,416 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/safe003_power.opt.i[951,964] [2023-08-31 23:32:17,556 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:32:17,592 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:32:17,602 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/safe003_power.opt.i[951,964] [2023-08-31 23:32:17,653 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:32:17,692 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:32:17,692 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:32:17,697 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:32:17,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:32:17 WrapperNode [2023-08-31 23:32:17,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:32:17,698 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:32:17,698 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:32:17,698 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:32:17,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:32:17" (1/1) ... [2023-08-31 23:32:17,730 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:32:17" (1/1) ... [2023-08-31 23:32:17,762 INFO L138 Inliner]: procedures = 180, calls = 73, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 182 [2023-08-31 23:32:17,763 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:32:17,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:32:17,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:32:17,764 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:32:17,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:32:17" (1/1) ... [2023-08-31 23:32:17,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:32:17" (1/1) ... [2023-08-31 23:32:17,782 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:32:17" (1/1) ... [2023-08-31 23:32:17,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:32:17" (1/1) ... [2023-08-31 23:32:17,794 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:32:17" (1/1) ... [2023-08-31 23:32:17,806 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:32:17" (1/1) ... [2023-08-31 23:32:17,809 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:32:17" (1/1) ... [2023-08-31 23:32:17,815 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:32:17" (1/1) ... [2023-08-31 23:32:17,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:32:17,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:32:17,820 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:32:17,820 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:32:17,821 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:32:17" (1/1) ... [2023-08-31 23:32:17,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:32:17,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:32:17,841 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-31 23:32:17,856 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-31 23:32:17,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-31 23:32:17,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:32:17,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:32:17,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:32:17,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:32:17,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:32:17,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:32:17,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-08-31 23:32:17,875 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:32:17,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:32:17,876 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:32:17,876 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:32:17,876 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:32:17,876 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:32:17,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:32:17,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:32:17,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:32:17,878 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:32:18,053 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:32:18,054 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:32:18,520 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:32:18,941 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:32:18,941 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:32:18,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:32:18 BoogieIcfgContainer [2023-08-31 23:32:18,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:32:18,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:32:18,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:32:18,946 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:32:18,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:32:17" (1/3) ... [2023-08-31 23:32:18,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76346dd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:32:18, skipping insertion in model container [2023-08-31 23:32:18,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:32:17" (2/3) ... [2023-08-31 23:32:18,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76346dd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:32:18, skipping insertion in model container [2023-08-31 23:32:18,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:32:18" (3/3) ... [2023-08-31 23:32:18,948 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.opt.i [2023-08-31 23:32:18,959 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:32:18,959 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2023-08-31 23:32:18,959 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:32:19,035 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:32:19,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 172 transitions, 359 flow [2023-08-31 23:32:19,116 INFO L130 PetriNetUnfolder]: 2/169 cut-off events. [2023-08-31 23:32:19,116 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:32:19,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 169 events. 2/169 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 249 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-08-31 23:32:19,121 INFO L82 GeneralOperation]: Start removeDead. Operand has 180 places, 172 transitions, 359 flow [2023-08-31 23:32:19,124 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 177 places, 169 transitions, 347 flow [2023-08-31 23:32:19,126 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:32:19,132 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 169 transitions, 347 flow [2023-08-31 23:32:19,133 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 169 transitions, 347 flow [2023-08-31 23:32:19,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 169 transitions, 347 flow [2023-08-31 23:32:19,173 INFO L130 PetriNetUnfolder]: 2/169 cut-off events. [2023-08-31 23:32:19,174 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:32:19,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 169 events. 2/169 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 246 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-08-31 23:32:19,178 INFO L119 LiptonReduction]: Number of co-enabled transitions 6224 [2023-08-31 23:32:37,750 INFO L134 LiptonReduction]: Checked pairs total: 31029 [2023-08-31 23:32:37,751 INFO L136 LiptonReduction]: Total number of compositions: 147 [2023-08-31 23:32:37,762 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:32:37,766 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;@23e35b7e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:32:37,766 INFO L358 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2023-08-31 23:32:37,767 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:32:37,767 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:32:37,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:32:37,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:32:37,768 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:32:37,770 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:32:37,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1121, now seen corresponding path program 1 times [2023-08-31 23:32:37,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:32:37,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [157261985] [2023-08-31 23:32:37,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:32:37,778 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-31 23:32:37,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:32:37,779 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-31 23:32:37,780 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-31 23:32:37,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:32:37,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:32:37,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:32:37,882 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-31 23:32:37,882 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:32:37,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:32:37,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [157261985] [2023-08-31 23:32:37,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [157261985] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:32:37,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:32:37,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:32:37,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860180439] [2023-08-31 23:32:37,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:32:37,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:32:37,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:32:37,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:32:37,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:32:37,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 319 [2023-08-31 23:32:37,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 71 transitions, 151 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-31 23:32:37,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:32:37,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 319 [2023-08-31 23:32:37,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:32:41,996 INFO L130 PetriNetUnfolder]: 31868/44399 cut-off events. [2023-08-31 23:32:41,996 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-31 23:32:42,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88825 conditions, 44399 events. 31868/44399 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 3439. Compared 317073 event pairs, 31868 based on Foata normal form. 0/17974 useless extension candidates. Maximal degree in co-relation 88814. Up to 44200 conditions per place. [2023-08-31 23:32:42,225 INFO L137 encePairwiseOnDemand]: 298/319 looper letters, 47 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2023-08-31 23:32:42,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 201 flow [2023-08-31 23:32:42,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:32:42,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:32:42,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 316 transitions. [2023-08-31 23:32:42,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4952978056426332 [2023-08-31 23:32:42,234 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 316 transitions. [2023-08-31 23:32:42,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 316 transitions. [2023-08-31 23:32:42,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:32:42,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 316 transitions. [2023-08-31 23:32:42,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 158.0) internal successors, (316), 2 states have internal predecessors, (316), 0 states have call successors, (0), 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-31 23:32:42,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 states have internal predecessors, (957), 0 states have call successors, (0), 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-31 23:32:42,245 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 states have internal predecessors, (957), 0 states have call successors, (0), 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-31 23:32:42,246 INFO L175 Difference]: Start difference. First operand has 80 places, 71 transitions, 151 flow. Second operand 2 states and 316 transitions. [2023-08-31 23:32:42,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 201 flow [2023-08-31 23:32:42,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 198 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:32:42,257 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 104 flow [2023-08-31 23:32:42,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=104, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2023-08-31 23:32:42,261 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -23 predicate places. [2023-08-31 23:32:42,261 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 104 flow [2023-08-31 23:32:42,262 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-31 23:32:42,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:32:42,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-31 23:32:42,268 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 (2)] Ended with exit code 0 [2023-08-31 23:32:42,468 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-31 23:32:42,469 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:32:42,469 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:32:42,469 INFO L85 PathProgramCache]: Analyzing trace with hash 34304809, now seen corresponding path program 1 times [2023-08-31 23:32:42,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:32:42,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [92681290] [2023-08-31 23:32:42,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:32:42,473 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-31 23:32:42,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:32:42,474 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-31 23:32:42,476 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-31 23:32:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:32:42,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:32:42,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:32:42,591 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-31 23:32:42,591 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:32:42,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:32:42,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [92681290] [2023-08-31 23:32:42,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [92681290] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:32:42,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:32:42,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:32:42,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101391385] [2023-08-31 23:32:42,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:32:42,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:32:42,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:32:42,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:32:42,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:32:42,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 319 [2023-08-31 23:32:42,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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-31 23:32:42,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:32:42,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 319 [2023-08-31 23:32:42,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:32:46,106 INFO L130 PetriNetUnfolder]: 28558/39696 cut-off events. [2023-08-31 23:32:46,106 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:32:46,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79555 conditions, 39696 events. 28558/39696 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3081. Compared 302963 event pairs, 5388 based on Foata normal form. 0/16866 useless extension candidates. Maximal degree in co-relation 79552. Up to 31802 conditions per place. [2023-08-31 23:32:46,275 INFO L137 encePairwiseOnDemand]: 316/319 looper letters, 80 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2023-08-31 23:32:46,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 84 transitions, 342 flow [2023-08-31 23:32:46,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:32:46,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:32:46,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2023-08-31 23:32:46,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4723092998955068 [2023-08-31 23:32:46,278 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2023-08-31 23:32:46,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2023-08-31 23:32:46,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:32:46,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2023-08-31 23:32:46,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 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-31 23:32:46,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 319.0) internal successors, (1276), 4 states have internal predecessors, (1276), 0 states have call successors, (0), 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-31 23:32:46,281 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 319.0) internal successors, (1276), 4 states have internal predecessors, (1276), 0 states have call successors, (0), 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-31 23:32:46,282 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 104 flow. Second operand 3 states and 452 transitions. [2023-08-31 23:32:46,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 84 transitions, 342 flow [2023-08-31 23:32:46,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 342 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:32:46,283 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 106 flow [2023-08-31 23:32:46,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2023-08-31 23:32:46,284 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -22 predicate places. [2023-08-31 23:32:46,284 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 106 flow [2023-08-31 23:32:46,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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-31 23:32:46,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:32:46,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-31 23:32:46,293 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 (3)] Ended with exit code 0 [2023-08-31 23:32:46,491 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-31 23:32:46,492 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:32:46,493 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:32:46,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1063450003, now seen corresponding path program 1 times [2023-08-31 23:32:46,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:32:46,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2059213995] [2023-08-31 23:32:46,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:32:46,496 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-31 23:32:46,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:32:46,497 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-31 23:32:46,499 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-31 23:32:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:32:46,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-31 23:32:46,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:32:46,607 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-31 23:32:46,608 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:32:46,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:32:46,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2059213995] [2023-08-31 23:32:46,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2059213995] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:32:46,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:32:46,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:32:46,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776130286] [2023-08-31 23:32:46,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:32:46,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:32:46,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:32:46,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:32:46,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:32:46,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 319 [2023-08-31 23:32:46,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 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-31 23:32:46,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:32:46,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 319 [2023-08-31 23:32:46,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:32:51,170 INFO L130 PetriNetUnfolder]: 36763/51148 cut-off events. [2023-08-31 23:32:51,170 INFO L131 PetriNetUnfolder]: For 1232/1232 co-relation queries the response was YES. [2023-08-31 23:32:51,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103572 conditions, 51148 events. 36763/51148 cut-off events. For 1232/1232 co-relation queries the response was YES. Maximal size of possible extension queue 4161. Compared 381975 event pairs, 23293 based on Foata normal form. 0/21274 useless extension candidates. Maximal degree in co-relation 103568. Up to 38760 conditions per place. [2023-08-31 23:32:51,387 INFO L137 encePairwiseOnDemand]: 311/319 looper letters, 79 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2023-08-31 23:32:51,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 87 transitions, 358 flow [2023-08-31 23:32:51,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:32:51,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:32:51,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2023-08-31 23:32:51,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47335423197492166 [2023-08-31 23:32:51,390 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 453 transitions. [2023-08-31 23:32:51,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions. [2023-08-31 23:32:51,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:32:51,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions. [2023-08-31 23:32:51,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 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-31 23:32:51,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 319.0) internal successors, (1276), 4 states have internal predecessors, (1276), 0 states have call successors, (0), 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-31 23:32:51,393 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 319.0) internal successors, (1276), 4 states have internal predecessors, (1276), 0 states have call successors, (0), 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-31 23:32:51,393 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 106 flow. Second operand 3 states and 453 transitions. [2023-08-31 23:32:51,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 87 transitions, 358 flow [2023-08-31 23:32:51,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 87 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:32:51,395 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 144 flow [2023-08-31 23:32:51,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2023-08-31 23:32:51,396 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -21 predicate places. [2023-08-31 23:32:51,396 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 144 flow [2023-08-31 23:32:51,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 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-31 23:32:51,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:32:51,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-31 23:32:51,403 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-31 23:32:51,603 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-31 23:32:51,603 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:32:51,603 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:32:51,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1063450005, now seen corresponding path program 1 times [2023-08-31 23:32:51,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:32:51,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1216247010] [2023-08-31 23:32:51,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:32:51,604 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-31 23:32:51,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:32:51,605 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-31 23:32:51,613 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-31 23:32:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:32:51,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:32:51,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:32:51,743 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-31 23:32:51,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-08-31 23:32:51,792 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-31 23:32:51,793 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:32:51,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:32:51,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1216247010] [2023-08-31 23:32:51,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1216247010] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:32:51,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:32:51,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:32:51,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727935656] [2023-08-31 23:32:51,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:32:51,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:32:51,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:32:51,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:32:51,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:32:51,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 319 [2023-08-31 23:32:51,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 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-31 23:32:51,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:32:51,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 319 [2023-08-31 23:32:51,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:32:54,119 INFO L130 PetriNetUnfolder]: 18173/25645 cut-off events. [2023-08-31 23:32:54,120 INFO L131 PetriNetUnfolder]: For 6146/6261 co-relation queries the response was YES. [2023-08-31 23:32:54,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58999 conditions, 25645 events. 18173/25645 cut-off events. For 6146/6261 co-relation queries the response was YES. Maximal size of possible extension queue 1791. Compared 173052 event pairs, 10086 based on Foata normal form. 0/17231 useless extension candidates. Maximal degree in co-relation 58994. Up to 13595 conditions per place. [2023-08-31 23:32:54,242 INFO L137 encePairwiseOnDemand]: 308/319 looper letters, 68 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2023-08-31 23:32:54,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 72 transitions, 347 flow [2023-08-31 23:32:54,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:32:54,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:32:54,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2023-08-31 23:32:54,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45245559038662486 [2023-08-31 23:32:54,244 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2023-08-31 23:32:54,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2023-08-31 23:32:54,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:32:54,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2023-08-31 23:32:54,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 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-31 23:32:54,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 319.0) internal successors, (1276), 4 states have internal predecessors, (1276), 0 states have call successors, (0), 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-31 23:32:54,247 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 319.0) internal successors, (1276), 4 states have internal predecessors, (1276), 0 states have call successors, (0), 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-31 23:32:54,248 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 144 flow. Second operand 3 states and 433 transitions. [2023-08-31 23:32:54,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 72 transitions, 347 flow [2023-08-31 23:32:54,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 72 transitions, 336 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:32:54,271 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 154 flow [2023-08-31 23:32:54,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2023-08-31 23:32:54,271 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -21 predicate places. [2023-08-31 23:32:54,272 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 154 flow [2023-08-31 23:32:54,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 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-31 23:32:54,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:32:54,272 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-31 23:32:54,280 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-31 23:32:54,478 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-31 23:32:54,478 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:32:54,479 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:32:54,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1063450006, now seen corresponding path program 1 times [2023-08-31 23:32:54,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:32:54,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [669687043] [2023-08-31 23:32:54,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:32:54,479 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-31 23:32:54,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:32:54,480 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-31 23:32:54,481 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-31 23:32:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:32:54,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:32:54,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:32:54,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 23:32:54,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-31 23:32:54,622 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-31 23:32:54,623 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:32:54,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:32:54,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [669687043] [2023-08-31 23:32:54,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [669687043] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:32:54,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:32:54,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:32:54,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812896294] [2023-08-31 23:32:54,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:32:54,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:32:54,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:32:54,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:32:54,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:32:54,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 319 [2023-08-31 23:32:54,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 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-31 23:32:54,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:32:54,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 319 [2023-08-31 23:32:54,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:32:55,368 INFO L130 PetriNetUnfolder]: 5199/7521 cut-off events. [2023-08-31 23:32:55,368 INFO L131 PetriNetUnfolder]: For 2867/2902 co-relation queries the response was YES. [2023-08-31 23:32:55,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19250 conditions, 7521 events. 5199/7521 cut-off events. For 2867/2902 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 42931 event pairs, 4639 based on Foata normal form. 1868/8235 useless extension candidates. Maximal degree in co-relation 19244. Up to 7464 conditions per place. [2023-08-31 23:32:55,395 INFO L137 encePairwiseOnDemand]: 309/319 looper letters, 39 selfloop transitions, 1 changer transitions 0/42 dead transitions. [2023-08-31 23:32:55,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 42 transitions, 214 flow [2023-08-31 23:32:55,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:32:55,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:32:55,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2023-08-31 23:32:55,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4346917450365726 [2023-08-31 23:32:55,397 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2023-08-31 23:32:55,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2023-08-31 23:32:55,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:32:55,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2023-08-31 23:32:55,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 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-31 23:32:55,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 319.0) internal successors, (1276), 4 states have internal predecessors, (1276), 0 states have call successors, (0), 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-31 23:32:55,400 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 319.0) internal successors, (1276), 4 states have internal predecessors, (1276), 0 states have call successors, (0), 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-31 23:32:55,400 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 154 flow. Second operand 3 states and 416 transitions. [2023-08-31 23:32:55,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 42 transitions, 214 flow [2023-08-31 23:32:55,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 42 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:32:55,403 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 132 flow [2023-08-31 23:32:55,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-08-31 23:32:55,403 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -30 predicate places. [2023-08-31 23:32:55,404 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 132 flow [2023-08-31 23:32:55,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 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-31 23:32:55,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:32:55,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:32:55,410 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 (6)] Ended with exit code 0 [2023-08-31 23:32:55,610 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-31 23:32:55,611 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:32:55,611 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:32:55,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1908950064, now seen corresponding path program 1 times [2023-08-31 23:32:55,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:32:55,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [634745687] [2023-08-31 23:32:55,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:32:55,612 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-31 23:32:55,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:32:55,613 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-31 23:32:55,613 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-31 23:32:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:32:55,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:32:55,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:32:55,736 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-31 23:32:55,736 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:32:55,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:32:55,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [634745687] [2023-08-31 23:32:55,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [634745687] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:32:55,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:32:55,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:32:55,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169519735] [2023-08-31 23:32:55,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:32:55,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:32:55,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:32:55,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:32:55,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:32:55,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 319 [2023-08-31 23:32:55,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 132 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-31 23:32:55,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:32:55,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 319 [2023-08-31 23:32:55,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:32:56,258 INFO L130 PetriNetUnfolder]: 1879/3031 cut-off events. [2023-08-31 23:32:56,258 INFO L131 PetriNetUnfolder]: For 1141/1144 co-relation queries the response was YES. [2023-08-31 23:32:56,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7594 conditions, 3031 events. 1879/3031 cut-off events. For 1141/1144 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 17105 event pairs, 680 based on Foata normal form. 94/2714 useless extension candidates. Maximal degree in co-relation 7588. Up to 2535 conditions per place. [2023-08-31 23:32:56,265 INFO L137 encePairwiseOnDemand]: 313/319 looper letters, 56 selfloop transitions, 4 changer transitions 29/91 dead transitions. [2023-08-31 23:32:56,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 91 transitions, 466 flow [2023-08-31 23:32:56,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:32:56,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:32:56,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 669 transitions. [2023-08-31 23:32:56,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.419435736677116 [2023-08-31 23:32:56,267 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 669 transitions. [2023-08-31 23:32:56,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 669 transitions. [2023-08-31 23:32:56,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:32:56,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 669 transitions. [2023-08-31 23:32:56,268 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-31 23:32:56,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 319.0) internal successors, (1914), 6 states have internal predecessors, (1914), 0 states have call successors, (0), 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-31 23:32:56,271 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 319.0) internal successors, (1914), 6 states have internal predecessors, (1914), 0 states have call successors, (0), 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-31 23:32:56,271 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 132 flow. Second operand 5 states and 669 transitions. [2023-08-31 23:32:56,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 91 transitions, 466 flow [2023-08-31 23:32:56,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 91 transitions, 465 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:32:56,272 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 171 flow [2023-08-31 23:32:56,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2023-08-31 23:32:56,273 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -24 predicate places. [2023-08-31 23:32:56,273 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 171 flow [2023-08-31 23:32:56,273 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-31 23:32:56,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:32:56,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:32:56,281 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 (7)] Forceful destruction successful, exit code 0 [2023-08-31 23:32:56,484 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-31 23:32:56,485 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:32:56,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:32:56,485 INFO L85 PathProgramCache]: Analyzing trace with hash -313015302, now seen corresponding path program 1 times [2023-08-31 23:32:56,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:32:56,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316255451] [2023-08-31 23:32:56,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:32:56,486 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-31 23:32:56,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:32:56,487 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-31 23:32:56,488 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-31 23:32:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:32:56,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:32:56,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:32:56,620 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-31 23:32:56,620 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:32:56,620 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:32:56,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1316255451] [2023-08-31 23:32:56,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1316255451] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:32:56,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:32:56,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:32:56,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479590571] [2023-08-31 23:32:56,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:32:56,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:32:56,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:32:56,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:32:56,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:32:56,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 319 [2023-08-31 23:32:56,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 171 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-31 23:32:56,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:32:56,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 319 [2023-08-31 23:32:56,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:32:56,920 INFO L130 PetriNetUnfolder]: 456/859 cut-off events. [2023-08-31 23:32:56,920 INFO L131 PetriNetUnfolder]: For 640/643 co-relation queries the response was YES. [2023-08-31 23:32:56,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2500 conditions, 859 events. 456/859 cut-off events. For 640/643 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3968 event pairs, 137 based on Foata normal form. 51/842 useless extension candidates. Maximal degree in co-relation 2491. Up to 329 conditions per place. [2023-08-31 23:32:56,922 INFO L137 encePairwiseOnDemand]: 313/319 looper letters, 67 selfloop transitions, 7 changer transitions 26/102 dead transitions. [2023-08-31 23:32:56,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 102 transitions, 589 flow [2023-08-31 23:32:56,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:32:56,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:32:56,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 801 transitions. [2023-08-31 23:32:56,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41849529780564265 [2023-08-31 23:32:56,925 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 801 transitions. [2023-08-31 23:32:56,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 801 transitions. [2023-08-31 23:32:56,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:32:56,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 801 transitions. [2023-08-31 23:32:56,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.5) internal successors, (801), 6 states have internal predecessors, (801), 0 states have call successors, (0), 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-31 23:32:56,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 319.0) internal successors, (2233), 7 states have internal predecessors, (2233), 0 states have call successors, (0), 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-31 23:32:56,928 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 319.0) internal successors, (2233), 7 states have internal predecessors, (2233), 0 states have call successors, (0), 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-31 23:32:56,928 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 171 flow. Second operand 6 states and 801 transitions. [2023-08-31 23:32:56,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 102 transitions, 589 flow [2023-08-31 23:32:56,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 102 transitions, 581 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-31 23:32:56,932 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 223 flow [2023-08-31 23:32:56,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=223, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2023-08-31 23:32:56,933 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -20 predicate places. [2023-08-31 23:32:56,933 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 223 flow [2023-08-31 23:32:56,934 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-31 23:32:56,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:32:56,934 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:32:56,941 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 (8)] Ended with exit code 0 [2023-08-31 23:32:57,141 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-31 23:32:57,141 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:32:57,141 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:32:57,141 INFO L85 PathProgramCache]: Analyzing trace with hash 751352060, now seen corresponding path program 1 times [2023-08-31 23:32:57,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:32:57,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188407228] [2023-08-31 23:32:57,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:32:57,142 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:32:57,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:32:57,143 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-31 23:32:57,145 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-31 23:32:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:32:57,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:32:57,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:32:57,303 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-31 23:32:57,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:32:57,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:32:57,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188407228] [2023-08-31 23:32:57,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [188407228] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:32:57,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:32:57,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:32:57,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118016976] [2023-08-31 23:32:57,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:32:57,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:32:57,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:32:57,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:32:57,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:32:57,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 319 [2023-08-31 23:32:57,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 223 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-31 23:32:57,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:32:57,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 319 [2023-08-31 23:32:57,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:32:57,634 INFO L130 PetriNetUnfolder]: 255/477 cut-off events. [2023-08-31 23:32:57,635 INFO L131 PetriNetUnfolder]: For 605/608 co-relation queries the response was YES. [2023-08-31 23:32:57,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1495 conditions, 477 events. 255/477 cut-off events. For 605/608 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1919 event pairs, 95 based on Foata normal form. 12/481 useless extension candidates. Maximal degree in co-relation 1484. Up to 215 conditions per place. [2023-08-31 23:32:57,636 INFO L137 encePairwiseOnDemand]: 313/319 looper letters, 55 selfloop transitions, 10 changer transitions 13/80 dead transitions. [2023-08-31 23:32:57,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 80 transitions, 495 flow [2023-08-31 23:32:57,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:32:57,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:32:57,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 903 transitions. [2023-08-31 23:32:57,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4043887147335423 [2023-08-31 23:32:57,639 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 903 transitions. [2023-08-31 23:32:57,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 903 transitions. [2023-08-31 23:32:57,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:32:57,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 903 transitions. [2023-08-31 23:32:57,640 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-31 23:32:57,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 319.0) internal successors, (2552), 8 states have internal predecessors, (2552), 0 states have call successors, (0), 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-31 23:32:57,642 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 319.0) internal successors, (2552), 8 states have internal predecessors, (2552), 0 states have call successors, (0), 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-31 23:32:57,643 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 223 flow. Second operand 7 states and 903 transitions. [2023-08-31 23:32:57,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 80 transitions, 495 flow [2023-08-31 23:32:57,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 80 transitions, 457 flow, removed 14 selfloop flow, removed 5 redundant places. [2023-08-31 23:32:57,646 INFO L231 Difference]: Finished difference. Result has 55 places, 39 transitions, 181 flow [2023-08-31 23:32:57,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=181, PETRI_PLACES=55, PETRI_TRANSITIONS=39} [2023-08-31 23:32:57,646 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -25 predicate places. [2023-08-31 23:32:57,646 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 39 transitions, 181 flow [2023-08-31 23:32:57,647 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-31 23:32:57,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:32:57,647 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] [2023-08-31 23:32:57,657 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-31 23:32:57,854 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-31 23:32:57,854 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:32:57,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:32:57,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1925746073, now seen corresponding path program 1 times [2023-08-31 23:32:57,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:32:57,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [68701289] [2023-08-31 23:32:57,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:32:57,856 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-31 23:32:57,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:32:57,857 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-31 23:32:57,859 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-31 23:32:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:32:57,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-31 23:32:57,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:32:58,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-31 23:32:59,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-31 23:32:59,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2023-08-31 23:32:59,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-31 23:32:59,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-31 23:32:59,324 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-31 23:32:59,325 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:32:59,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:32:59,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [68701289] [2023-08-31 23:32:59,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [68701289] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:32:59,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:32:59,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:32:59,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719223068] [2023-08-31 23:32:59,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:32:59,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:32:59,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:32:59,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:32:59,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:32:59,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 319 [2023-08-31 23:32:59,531 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 39 transitions, 181 flow. Second operand has 7 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 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-31 23:32:59,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:32:59,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 319 [2023-08-31 23:32:59,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:32:59,839 INFO L130 PetriNetUnfolder]: 296/574 cut-off events. [2023-08-31 23:32:59,839 INFO L131 PetriNetUnfolder]: For 655/667 co-relation queries the response was YES. [2023-08-31 23:32:59,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1815 conditions, 574 events. 296/574 cut-off events. For 655/667 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2646 event pairs, 47 based on Foata normal form. 3/574 useless extension candidates. Maximal degree in co-relation 1804. Up to 229 conditions per place. [2023-08-31 23:32:59,841 INFO L137 encePairwiseOnDemand]: 311/319 looper letters, 76 selfloop transitions, 13 changer transitions 0/91 dead transitions. [2023-08-31 23:32:59,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 91 transitions, 617 flow [2023-08-31 23:32:59,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:32:59,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:32:59,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 891 transitions. [2023-08-31 23:32:59,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39901477832512317 [2023-08-31 23:32:59,843 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 891 transitions. [2023-08-31 23:32:59,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 891 transitions. [2023-08-31 23:32:59,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:32:59,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 891 transitions. [2023-08-31 23:32:59,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.28571428571429) internal successors, (891), 7 states have internal predecessors, (891), 0 states have call successors, (0), 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-31 23:32:59,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 319.0) internal successors, (2552), 8 states have internal predecessors, (2552), 0 states have call successors, (0), 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-31 23:32:59,847 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 319.0) internal successors, (2552), 8 states have internal predecessors, (2552), 0 states have call successors, (0), 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-31 23:32:59,847 INFO L175 Difference]: Start difference. First operand has 55 places, 39 transitions, 181 flow. Second operand 7 states and 891 transitions. [2023-08-31 23:32:59,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 91 transitions, 617 flow [2023-08-31 23:32:59,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 91 transitions, 525 flow, removed 26 selfloop flow, removed 6 redundant places. [2023-08-31 23:32:59,850 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 209 flow [2023-08-31 23:32:59,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=209, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2023-08-31 23:32:59,850 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -27 predicate places. [2023-08-31 23:32:59,850 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 209 flow [2023-08-31 23:32:59,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 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-31 23:32:59,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:32:59,851 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] [2023-08-31 23:32:59,861 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-31 23:33:00,059 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-31 23:33:00,059 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:33:00,060 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:33:00,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1362554199, now seen corresponding path program 1 times [2023-08-31 23:33:00,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:33:00,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1979157128] [2023-08-31 23:33:00,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:33:00,060 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-31 23:33:00,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:33:00,061 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-31 23:33:00,062 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-31 23:33:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:33:00,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:33:00,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:33:00,215 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-31 23:33:00,216 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:33:00,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:33:00,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1979157128] [2023-08-31 23:33:00,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1979157128] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:33:00,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:33:00,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:33:00,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169383737] [2023-08-31 23:33:00,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:33:00,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:33:00,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:33:00,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:33:00,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:33:00,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 319 [2023-08-31 23:33:00,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 209 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-31 23:33:00,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:33:00,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 319 [2023-08-31 23:33:00,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:33:00,520 INFO L130 PetriNetUnfolder]: 737/1415 cut-off events. [2023-08-31 23:33:00,520 INFO L131 PetriNetUnfolder]: For 2081/2081 co-relation queries the response was YES. [2023-08-31 23:33:00,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4935 conditions, 1415 events. 737/1415 cut-off events. For 2081/2081 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8041 event pairs, 176 based on Foata normal form. 0/1411 useless extension candidates. Maximal degree in co-relation 4925. Up to 492 conditions per place. [2023-08-31 23:33:00,525 INFO L137 encePairwiseOnDemand]: 315/319 looper letters, 134 selfloop transitions, 5 changer transitions 0/140 dead transitions. [2023-08-31 23:33:00,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 140 transitions, 960 flow [2023-08-31 23:33:00,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:33:00,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:33:00,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 678 transitions. [2023-08-31 23:33:00,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4250783699059561 [2023-08-31 23:33:00,527 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 678 transitions. [2023-08-31 23:33:00,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 678 transitions. [2023-08-31 23:33:00,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:33:00,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 678 transitions. [2023-08-31 23:33:00,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.6) internal successors, (678), 5 states have internal predecessors, (678), 0 states have call successors, (0), 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-31 23:33:00,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 319.0) internal successors, (1914), 6 states have internal predecessors, (1914), 0 states have call successors, (0), 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-31 23:33:00,530 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 319.0) internal successors, (1914), 6 states have internal predecessors, (1914), 0 states have call successors, (0), 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-31 23:33:00,530 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 209 flow. Second operand 5 states and 678 transitions. [2023-08-31 23:33:00,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 140 transitions, 960 flow [2023-08-31 23:33:00,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 140 transitions, 959 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:33:00,536 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 246 flow [2023-08-31 23:33:00,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=246, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2023-08-31 23:33:00,537 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -20 predicate places. [2023-08-31 23:33:00,537 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 246 flow [2023-08-31 23:33:00,537 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-31 23:33:00,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:33:00,538 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] [2023-08-31 23:33:00,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 (11)] Forceful destruction successful, exit code 0 [2023-08-31 23:33:00,745 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-31 23:33:00,745 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-31 23:33:00,746 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:33:00,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1824050969, now seen corresponding path program 2 times [2023-08-31 23:33:00,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:33:00,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291136276] [2023-08-31 23:33:00,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:33:00,746 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-31 23:33:00,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:33:00,747 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-31 23:33:00,748 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-31 23:33:00,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:33:00,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:33:00,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:33:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:33:01,098 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:33:01,098 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:33:01,099 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (74 of 75 remaining) [2023-08-31 23:33:01,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (73 of 75 remaining) [2023-08-31 23:33:01,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 75 remaining) [2023-08-31 23:33:01,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 75 remaining) [2023-08-31 23:33:01,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 75 remaining) [2023-08-31 23:33:01,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 75 remaining) [2023-08-31 23:33:01,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 75 remaining) [2023-08-31 23:33:01,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 75 remaining) [2023-08-31 23:33:01,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 75 remaining) [2023-08-31 23:33:01,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 75 remaining) [2023-08-31 23:33:01,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 75 remaining) [2023-08-31 23:33:01,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 75 remaining) [2023-08-31 23:33:01,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 75 remaining) [2023-08-31 23:33:01,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 75 remaining) [2023-08-31 23:33:01,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 75 remaining) [2023-08-31 23:33:01,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 75 remaining) [2023-08-31 23:33:01,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 75 remaining) [2023-08-31 23:33:01,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 75 remaining) [2023-08-31 23:33:01,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 75 remaining) [2023-08-31 23:33:01,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 75 remaining) [2023-08-31 23:33:01,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 75 remaining) [2023-08-31 23:33:01,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 75 remaining) [2023-08-31 23:33:01,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 75 remaining) [2023-08-31 23:33:01,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 75 remaining) [2023-08-31 23:33:01,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 75 remaining) [2023-08-31 23:33:01,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 75 remaining) [2023-08-31 23:33:01,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 75 remaining) [2023-08-31 23:33:01,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 75 remaining) [2023-08-31 23:33:01,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 75 remaining) [2023-08-31 23:33:01,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 75 remaining) [2023-08-31 23:33:01,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 75 remaining) [2023-08-31 23:33:01,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 75 remaining) [2023-08-31 23:33:01,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 75 remaining) [2023-08-31 23:33:01,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 75 remaining) [2023-08-31 23:33:01,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 75 remaining) [2023-08-31 23:33:01,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 75 remaining) [2023-08-31 23:33:01,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 75 remaining) [2023-08-31 23:33:01,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 75 remaining) [2023-08-31 23:33:01,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 75 remaining) [2023-08-31 23:33:01,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 75 remaining) [2023-08-31 23:33:01,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 75 remaining) [2023-08-31 23:33:01,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 75 remaining) [2023-08-31 23:33:01,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (32 of 75 remaining) [2023-08-31 23:33:01,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 75 remaining) [2023-08-31 23:33:01,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 75 remaining) [2023-08-31 23:33:01,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 75 remaining) [2023-08-31 23:33:01,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (28 of 75 remaining) [2023-08-31 23:33:01,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 75 remaining) [2023-08-31 23:33:01,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 75 remaining) [2023-08-31 23:33:01,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 75 remaining) [2023-08-31 23:33:01,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 75 remaining) [2023-08-31 23:33:01,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 75 remaining) [2023-08-31 23:33:01,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 75 remaining) [2023-08-31 23:33:01,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 75 remaining) [2023-08-31 23:33:01,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 75 remaining) [2023-08-31 23:33:01,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 75 remaining) [2023-08-31 23:33:01,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 75 remaining) [2023-08-31 23:33:01,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 75 remaining) [2023-08-31 23:33:01,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 75 remaining) [2023-08-31 23:33:01,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 75 remaining) [2023-08-31 23:33:01,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 75 remaining) [2023-08-31 23:33:01,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 75 remaining) [2023-08-31 23:33:01,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 75 remaining) [2023-08-31 23:33:01,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 75 remaining) [2023-08-31 23:33:01,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 75 remaining) [2023-08-31 23:33:01,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 75 remaining) [2023-08-31 23:33:01,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 75 remaining) [2023-08-31 23:33:01,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 75 remaining) [2023-08-31 23:33:01,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 75 remaining) [2023-08-31 23:33:01,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 75 remaining) [2023-08-31 23:33:01,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 75 remaining) [2023-08-31 23:33:01,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 75 remaining) [2023-08-31 23:33:01,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 75 remaining) [2023-08-31 23:33:01,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 75 remaining) [2023-08-31 23:33:01,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 75 remaining) [2023-08-31 23:33:01,139 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-31 23:33:01,321 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-31 23:33:01,321 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:33:01,325 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:33:01,326 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:33:01,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:33:01 BasicIcfg [2023-08-31 23:33:01,399 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:33:01,399 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:33:01,399 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:33:01,399 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:33:01,400 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:32:18" (3/4) ... [2023-08-31 23:33:01,401 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:33:01,401 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:33:01,402 INFO L158 Benchmark]: Toolchain (without parser) took 44117.04ms. Allocated memory was 69.2MB in the beginning and 6.4GB in the end (delta: 6.4GB). Free memory was 41.7MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 3.3GB. Max. memory is 16.1GB. [2023-08-31 23:33:01,402 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 69.2MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:33:01,402 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.89ms. Allocated memory was 69.2MB in the beginning and 102.8MB in the end (delta: 33.6MB). Free memory was 41.5MB in the beginning and 72.8MB in the end (delta: -31.3MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2023-08-31 23:33:01,402 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.58ms. Allocated memory is still 102.8MB. Free memory was 72.8MB in the beginning and 70.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 23:33:01,403 INFO L158 Benchmark]: Boogie Preprocessor took 55.32ms. Allocated memory is still 102.8MB. Free memory was 70.0MB in the beginning and 67.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:33:01,404 INFO L158 Benchmark]: RCFGBuilder took 1123.44ms. Allocated memory was 102.8MB in the beginning and 138.4MB in the end (delta: 35.7MB). Free memory was 67.5MB in the beginning and 99.2MB in the end (delta: -31.7MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. [2023-08-31 23:33:01,404 INFO L158 Benchmark]: TraceAbstraction took 42454.65ms. Allocated memory was 138.4MB in the beginning and 6.4GB in the end (delta: 6.3GB). Free memory was 98.1MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 3.3GB. Max. memory is 16.1GB. [2023-08-31 23:33:01,404 INFO L158 Benchmark]: Witness Printer took 2.33ms. Allocated memory is still 6.4GB. Free memory is still 3.1GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:33:01,406 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.09ms. Allocated memory is still 69.2MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 411.89ms. Allocated memory was 69.2MB in the beginning and 102.8MB in the end (delta: 33.6MB). Free memory was 41.5MB in the beginning and 72.8MB in the end (delta: -31.3MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.58ms. Allocated memory is still 102.8MB. Free memory was 72.8MB in the beginning and 70.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.32ms. Allocated memory is still 102.8MB. Free memory was 70.0MB in the beginning and 67.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1123.44ms. Allocated memory was 102.8MB in the beginning and 138.4MB in the end (delta: 35.7MB). Free memory was 67.5MB in the beginning and 99.2MB in the end (delta: -31.7MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. * TraceAbstraction took 42454.65ms. Allocated memory was 138.4MB in the beginning and 6.4GB in the end (delta: 6.3GB). Free memory was 98.1MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 3.3GB. Max. memory is 16.1GB. * Witness Printer took 2.33ms. Allocated memory is still 6.4GB. Free memory is still 3.1GB. 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: 18.6s, 177 PlacesBefore, 80 PlacesAfterwards, 169 TransitionsBefore, 71 TransitionsAfterwards, 6224 CoEnabledTransitionPairs, 7 FixpointIterations, 69 TrivialSequentialCompositions, 72 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 147 TotalNumberOfCompositions, 31029 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7519, independent: 6963, independent conditional: 0, independent unconditional: 6963, dependent: 556, dependent conditional: 0, dependent unconditional: 556, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2557, independent: 2473, independent conditional: 0, independent unconditional: 2473, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7519, independent: 4490, independent conditional: 0, independent unconditional: 4490, dependent: 472, dependent conditional: 0, dependent unconditional: 472, unknown: 2557, unknown conditional: 0, unknown unconditional: 2557] , Statistics on independence cache: Total cache size (in pairs): 342, Positive cache size: 287, Positive conditional cache size: 0, Positive unconditional cache size: 287, Negative cache size: 55, Negative conditional cache size: 0, Negative unconditional cache size: 55, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L712] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L713] 0 int __unbuffered_p1_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L722] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L723] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L724] 0 int __unbuffered_p1_EAX$w_buff0; [L725] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L726] 0 int __unbuffered_p1_EAX$w_buff1; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L729] 0 int __unbuffered_p2_EAX = 0; [L731] 0 int __unbuffered_p2_EBX = 0; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L736] 0 _Bool x$flush_delayed; [L737] 0 int x$mem_tmp; [L738] 0 _Bool x$r_buff0_thd0; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L741] 0 _Bool x$r_buff0_thd3; [L742] 0 _Bool x$r_buff1_thd0; [L743] 0 _Bool x$r_buff1_thd1; [L744] 0 _Bool x$r_buff1_thd2; [L745] 0 _Bool x$r_buff1_thd3; [L746] 0 _Bool x$read_delayed; [L747] 0 int *x$read_delayed_var; [L748] 0 int x$w_buff0; [L749] 0 _Bool x$w_buff0_used; [L750] 0 int x$w_buff1; [L751] 0 _Bool x$w_buff1_used; [L753] 0 int y = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1852; [L854] FCALL, FORK 0 pthread_create(&t1852, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1852, ((void *)0), P0, ((void *)0))=0, t1852={-2147483642:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L855] 0 pthread_t t1853; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1852={-2147483642:0}, t1853={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L856] FCALL, FORK 0 pthread_create(&t1853, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1853, ((void *)0), P1, ((void *)0))=1, t1852={-2147483642:0}, t1853={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] EXPR 2 \read(x) [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L857] 0 pthread_t t1854; [L808] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L858] FCALL, FORK 0 pthread_create(&t1854, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1854, ((void *)0), P2, ((void *)0))=2, t1852={-2147483642:0}, t1853={6:0}, t1854={134217731:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L825] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L828] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L760] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$$choice0=2, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L767] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L767] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$$choice0=2, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$$choice0=2, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1852={-2147483642:0}, t1853={6:0}, t1854={134217731:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L875] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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$$choice0=2, weak$$choice1=2, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -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: -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: -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: -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: -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: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, 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: 854]: 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: 856]: 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 7 procedures, 227 locations, 75 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: 42.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 18.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 18.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 636 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 480 mSDsluCounter, 217 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 200 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1717 IncrementalHoareTripleChecker+Invalid, 1796 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 17 mSDtfsCounter, 1717 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=246occurred in iteration=10, InterpolantAutomatonStates: 44, 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.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 585 SizeOfPredicates, 31 NumberOfNonLiveVariables, 1218 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:33:01,426 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