./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c22ca6d642b28badc1dc02a5cc527ddbb1f35b5d6d2e3ba3e8f314e81f0fd465 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:13:24,043 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:13:24,045 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:13:24,086 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:13:24,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:13:24,090 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:13:24,091 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:13:24,094 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:13:24,096 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:13:24,100 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:13:24,101 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:13:24,103 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:13:24,104 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:13:24,106 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:13:24,107 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:13:24,111 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:13:24,112 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:13:24,114 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:13:24,115 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:13:24,120 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:13:24,121 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:13:24,122 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:13:24,122 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:13:24,123 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:13:24,129 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:13:24,129 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:13:24,130 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:13:24,131 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:13:24,132 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:13:24,132 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:13:24,133 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:13:24,134 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:13:24,135 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:13:24,136 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:13:24,137 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:13:24,137 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:13:24,137 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:13:24,138 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:13:24,138 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:13:24,139 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:13:24,139 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:13:24,141 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 20:13:24,171 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:13:24,171 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:13:24,172 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:13:24,173 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:13:24,173 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:13:24,174 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:13:24,174 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:13:24,174 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:13:24,174 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:13:24,175 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:13:24,175 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:13:24,176 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:13:24,176 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:13:24,176 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:13:24,176 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:13:24,176 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:13:24,177 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:13:24,177 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:13:24,177 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:13:24,177 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:13:24,177 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:13:24,177 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:13:24,178 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:13:24,178 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:13:24,178 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:13:24,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:13:24,178 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:13:24,179 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:13:24,179 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:13:24,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:13:24,179 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:13:24,179 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:13:24,179 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:13:24,180 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:13:24,180 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 -> c22ca6d642b28badc1dc02a5cc527ddbb1f35b5d6d2e3ba3e8f314e81f0fd465 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 20:13:24,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:13:24,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:13:24,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:13:24,521 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:13:24,522 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:13:24,523 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2023-08-29 20:13:25,597 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:13:25,862 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:13:25,862 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2023-08-29 20:13:25,882 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b5572566/3742dbc4e81149249322d529ed833034/FLAGb3ca57539 [2023-08-29 20:13:25,892 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b5572566/3742dbc4e81149249322d529ed833034 [2023-08-29 20:13:25,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:13:25,895 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:13:25,896 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:13:25,896 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:13:25,899 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:13:25,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:13:25" (1/1) ... [2023-08-29 20:13:25,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54a28f2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:13:25, skipping insertion in model container [2023-08-29 20:13:25,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:13:25" (1/1) ... [2023-08-29 20:13:25,906 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:13:25,950 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:13:26,128 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/mix005_tso.oepc.i[949,962] [2023-08-29 20:13:26,391 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:13:26,404 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:13:26,415 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/mix005_tso.oepc.i[949,962] [2023-08-29 20:13:26,475 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:13:26,507 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:13:26,507 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:13:26,513 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:13:26,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:13:26 WrapperNode [2023-08-29 20:13:26,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:13:26,515 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:13:26,515 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:13:26,516 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:13:26,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:13:26" (1/1) ... [2023-08-29 20:13:26,551 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:13:26" (1/1) ... [2023-08-29 20:13:26,590 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 163 [2023-08-29 20:13:26,591 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:13:26,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:13:26,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:13:26,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:13:26,599 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:13:26" (1/1) ... [2023-08-29 20:13:26,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:13:26" (1/1) ... [2023-08-29 20:13:26,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:13:26" (1/1) ... [2023-08-29 20:13:26,614 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:13:26" (1/1) ... [2023-08-29 20:13:26,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:13:26" (1/1) ... [2023-08-29 20:13:26,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:13:26" (1/1) ... [2023-08-29 20:13:26,634 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:13:26" (1/1) ... [2023-08-29 20:13:26,639 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:13:26" (1/1) ... [2023-08-29 20:13:26,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:13:26,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:13:26,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:13:26,650 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:13:26,651 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:13:26" (1/1) ... [2023-08-29 20:13:26,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:13:26,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:13:26,694 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 20:13:26,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 20:13:26,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:13:26,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:13:26,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:13:26,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:13:26,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:13:26,734 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:13:26,734 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:13:26,734 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:13:26,734 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:13:26,735 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:13:26,735 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:13:26,735 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-29 20:13:26,735 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-29 20:13:26,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:13:26,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:13:26,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:13:26,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:13:26,737 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:13:26,938 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:13:26,939 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:13:27,310 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:13:27,430 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:13:27,430 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:13:27,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:13:27 BoogieIcfgContainer [2023-08-29 20:13:27,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:13:27,434 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:13:27,434 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:13:27,437 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:13:27,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:13:25" (1/3) ... [2023-08-29 20:13:27,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6302c508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:13:27, skipping insertion in model container [2023-08-29 20:13:27,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:13:26" (2/3) ... [2023-08-29 20:13:27,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6302c508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:13:27, skipping insertion in model container [2023-08-29 20:13:27,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:13:27" (3/3) ... [2023-08-29 20:13:27,439 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005_tso.oepc.i [2023-08-29 20:13:27,465 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:13:27,465 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-29 20:13:27,466 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:13:27,517 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:13:27,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 145 transitions, 310 flow [2023-08-29 20:13:27,614 INFO L130 PetriNetUnfolder]: 2/141 cut-off events. [2023-08-29 20:13:27,614 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:13:27,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 2/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-29 20:13:27,620 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 145 transitions, 310 flow [2023-08-29 20:13:27,624 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 141 transitions, 294 flow [2023-08-29 20:13:27,627 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:13:27,638 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 141 transitions, 294 flow [2023-08-29 20:13:27,640 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 141 transitions, 294 flow [2023-08-29 20:13:27,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 141 transitions, 294 flow [2023-08-29 20:13:27,663 INFO L130 PetriNetUnfolder]: 2/141 cut-off events. [2023-08-29 20:13:27,664 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:13:27,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 2/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-29 20:13:27,667 INFO L119 LiptonReduction]: Number of co-enabled transitions 3638 [2023-08-29 20:13:32,863 INFO L134 LiptonReduction]: Checked pairs total: 12096 [2023-08-29 20:13:32,864 INFO L136 LiptonReduction]: Total number of compositions: 127 [2023-08-29 20:13:32,876 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:13:32,881 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;@78eab1df, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:13:32,881 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-29 20:13:32,882 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:13:32,883 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:13:32,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:13:32,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:13:32,884 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:13:32,887 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:13:32,888 INFO L85 PathProgramCache]: Analyzing trace with hash 605, now seen corresponding path program 1 times [2023-08-29 20:13:32,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:13:32,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117253933] [2023-08-29 20:13:32,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:13:32,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:13:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:13:32,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:13:32,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:13:32,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117253933] [2023-08-29 20:13:32,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117253933] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:13:32,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:13:32,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:13:32,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750134013] [2023-08-29 20:13:32,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:13:32,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:13:32,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:13:33,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:13:33,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:13:33,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 272 [2023-08-29 20:13:33,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:33,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:13:33,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 272 [2023-08-29 20:13:33,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:13:34,269 INFO L130 PetriNetUnfolder]: 6949/9709 cut-off events. [2023-08-29 20:13:34,270 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2023-08-29 20:13:34,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19323 conditions, 9709 events. 6949/9709 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 53465 event pairs, 6949 based on Foata normal form. 0/8335 useless extension candidates. Maximal degree in co-relation 19311. Up to 9399 conditions per place. [2023-08-29 20:13:34,362 INFO L137 encePairwiseOnDemand]: 263/272 looper letters, 27 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2023-08-29 20:13:34,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 132 flow [2023-08-29 20:13:34,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:13:34,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:13:34,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 296 transitions. [2023-08-29 20:13:34,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5441176470588235 [2023-08-29 20:13:34,374 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 296 transitions. [2023-08-29 20:13:34,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 296 transitions. [2023-08-29 20:13:34,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:13:34,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 296 transitions. [2023-08-29 20:13:34,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 148.0) internal successors, (296), 2 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:34,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:34,384 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:34,385 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 2 states and 296 transitions. [2023-08-29 20:13:34,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 132 flow [2023-08-29 20:13:34,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:13:34,391 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2023-08-29 20:13:34,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-08-29 20:13:34,395 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2023-08-29 20:13:34,396 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2023-08-29 20:13:34,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:34,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:13:34,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 20:13:34,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:13:34,397 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:13:34,398 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:13:34,398 INFO L85 PathProgramCache]: Analyzing trace with hash 571540232, now seen corresponding path program 1 times [2023-08-29 20:13:34,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:13:34,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318670999] [2023-08-29 20:13:34,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:13:34,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:13:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:13:34,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:13:34,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:13:34,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318670999] [2023-08-29 20:13:34,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318670999] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:13:34,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:13:34,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:13:34,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408569551] [2023-08-29 20:13:34,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:13:34,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:13:34,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:13:34,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:13:34,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:13:34,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 272 [2023-08-29 20:13:34,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:34,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:13:34,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 272 [2023-08-29 20:13:34,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:13:35,595 INFO L130 PetriNetUnfolder]: 5463/7625 cut-off events. [2023-08-29 20:13:35,596 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:13:35,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15222 conditions, 7625 events. 5463/7625 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 40026 event pairs, 2045 based on Foata normal form. 0/7052 useless extension candidates. Maximal degree in co-relation 15219. Up to 5923 conditions per place. [2023-08-29 20:13:35,642 INFO L137 encePairwiseOnDemand]: 269/272 looper letters, 41 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2023-08-29 20:13:35,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 51 transitions, 204 flow [2023-08-29 20:13:35,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:13:35,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:13:35,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2023-08-29 20:13:35,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5306372549019608 [2023-08-29 20:13:35,646 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2023-08-29 20:13:35,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2023-08-29 20:13:35,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:13:35,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2023-08-29 20:13:35,648 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-29 20:13:35,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:35,651 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:35,651 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 3 states and 433 transitions. [2023-08-29 20:13:35,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 51 transitions, 204 flow [2023-08-29 20:13:35,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 51 transitions, 204 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:13:35,653 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 74 flow [2023-08-29 20:13:35,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-08-29 20:13:35,654 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2023-08-29 20:13:35,654 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 74 flow [2023-08-29 20:13:35,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:35,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:13:35,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:13:35,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:13:35,655 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:13:35,656 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:13:35,656 INFO L85 PathProgramCache]: Analyzing trace with hash -788898861, now seen corresponding path program 1 times [2023-08-29 20:13:35,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:13:35,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63140159] [2023-08-29 20:13:35,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:13:35,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:13:35,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:13:36,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:13:36,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:13:36,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63140159] [2023-08-29 20:13:36,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63140159] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:13:36,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:13:36,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:13:36,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678453940] [2023-08-29 20:13:36,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:13:36,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:13:36,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:13:36,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:13:36,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:13:36,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 272 [2023-08-29 20:13:36,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 74 flow. Second operand has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:36,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:13:36,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 272 [2023-08-29 20:13:36,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:13:38,315 INFO L130 PetriNetUnfolder]: 14509/19359 cut-off events. [2023-08-29 20:13:38,316 INFO L131 PetriNetUnfolder]: For 965/965 co-relation queries the response was YES. [2023-08-29 20:13:38,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39980 conditions, 19359 events. 14509/19359 cut-off events. For 965/965 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 95780 event pairs, 3197 based on Foata normal form. 0/18878 useless extension candidates. Maximal degree in co-relation 39976. Up to 9801 conditions per place. [2023-08-29 20:13:38,431 INFO L137 encePairwiseOnDemand]: 267/272 looper letters, 71 selfloop transitions, 5 changer transitions 0/77 dead transitions. [2023-08-29 20:13:38,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 77 transitions, 324 flow [2023-08-29 20:13:38,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:13:38,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:13:38,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 653 transitions. [2023-08-29 20:13:38,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4801470588235294 [2023-08-29 20:13:38,434 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 653 transitions. [2023-08-29 20:13:38,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 653 transitions. [2023-08-29 20:13:38,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:13:38,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 653 transitions. [2023-08-29 20:13:38,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.6) internal successors, (653), 5 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:38,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:38,440 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:38,440 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 74 flow. Second operand 5 states and 653 transitions. [2023-08-29 20:13:38,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 77 transitions, 324 flow [2023-08-29 20:13:38,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 77 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:13:38,443 INFO L231 Difference]: Finished difference. Result has 49 places, 34 transitions, 104 flow [2023-08-29 20:13:38,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=104, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2023-08-29 20:13:38,444 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -5 predicate places. [2023-08-29 20:13:38,444 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 104 flow [2023-08-29 20:13:38,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:38,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:13:38,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:13:38,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:13:38,446 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:13:38,446 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:13:38,446 INFO L85 PathProgramCache]: Analyzing trace with hash -788898826, now seen corresponding path program 1 times [2023-08-29 20:13:38,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:13:38,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373535904] [2023-08-29 20:13:38,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:13:38,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:13:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:13:39,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:13:39,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:13:39,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373535904] [2023-08-29 20:13:39,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373535904] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:13:39,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:13:39,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:13:39,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913638208] [2023-08-29 20:13:39,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:13:39,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:13:39,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:13:39,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:13:39,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:13:39,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 272 [2023-08-29 20:13:39,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 104 flow. Second operand has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:39,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:13:39,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 272 [2023-08-29 20:13:39,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:13:40,708 INFO L130 PetriNetUnfolder]: 8951/13060 cut-off events. [2023-08-29 20:13:40,709 INFO L131 PetriNetUnfolder]: For 2928/3008 co-relation queries the response was YES. [2023-08-29 20:13:40,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28183 conditions, 13060 events. 8951/13060 cut-off events. For 2928/3008 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 81460 event pairs, 1944 based on Foata normal form. 608/13492 useless extension candidates. Maximal degree in co-relation 28176. Up to 5193 conditions per place. [2023-08-29 20:13:40,781 INFO L137 encePairwiseOnDemand]: 266/272 looper letters, 70 selfloop transitions, 6 changer transitions 2/84 dead transitions. [2023-08-29 20:13:40,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 84 transitions, 384 flow [2023-08-29 20:13:40,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:13:40,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:13:40,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 860 transitions. [2023-08-29 20:13:40,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45168067226890757 [2023-08-29 20:13:40,784 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 860 transitions. [2023-08-29 20:13:40,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 860 transitions. [2023-08-29 20:13:40,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:13:40,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 860 transitions. [2023-08-29 20:13:40,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.85714285714286) internal successors, (860), 7 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:40,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:40,791 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:40,791 INFO L175 Difference]: Start difference. First operand has 49 places, 34 transitions, 104 flow. Second operand 7 states and 860 transitions. [2023-08-29 20:13:40,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 84 transitions, 384 flow [2023-08-29 20:13:40,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 84 transitions, 384 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:13:40,818 INFO L231 Difference]: Finished difference. Result has 58 places, 36 transitions, 136 flow [2023-08-29 20:13:40,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=58, PETRI_TRANSITIONS=36} [2023-08-29 20:13:40,820 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 4 predicate places. [2023-08-29 20:13:40,820 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 36 transitions, 136 flow [2023-08-29 20:13:40,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:40,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:13:40,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:13:40,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:13:40,821 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:13:40,821 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:13:40,822 INFO L85 PathProgramCache]: Analyzing trace with hash 2021985666, now seen corresponding path program 1 times [2023-08-29 20:13:40,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:13:40,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120981592] [2023-08-29 20:13:40,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:13:40,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:13:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:13:41,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:13:41,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:13:41,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120981592] [2023-08-29 20:13:41,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120981592] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:13:41,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:13:41,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:13:41,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773598537] [2023-08-29 20:13:41,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:13:41,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:13:41,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:13:41,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:13:41,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:13:41,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 272 [2023-08-29 20:13:41,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 36 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:41,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:13:41,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 272 [2023-08-29 20:13:41,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:13:43,647 INFO L130 PetriNetUnfolder]: 22041/29931 cut-off events. [2023-08-29 20:13:43,648 INFO L131 PetriNetUnfolder]: For 11985/11985 co-relation queries the response was YES. [2023-08-29 20:13:43,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69229 conditions, 29931 events. 22041/29931 cut-off events. For 11985/11985 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 168311 event pairs, 6249 based on Foata normal form. 480/30410 useless extension candidates. Maximal degree in co-relation 69218. Up to 20649 conditions per place. [2023-08-29 20:13:43,830 INFO L137 encePairwiseOnDemand]: 267/272 looper letters, 60 selfloop transitions, 5 changer transitions 16/82 dead transitions. [2023-08-29 20:13:43,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 82 transitions, 414 flow [2023-08-29 20:13:43,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:13:43,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:13:43,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 653 transitions. [2023-08-29 20:13:43,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4801470588235294 [2023-08-29 20:13:43,833 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 653 transitions. [2023-08-29 20:13:43,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 653 transitions. [2023-08-29 20:13:43,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:13:43,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 653 transitions. [2023-08-29 20:13:43,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.6) internal successors, (653), 5 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:43,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:43,838 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:43,839 INFO L175 Difference]: Start difference. First operand has 58 places, 36 transitions, 136 flow. Second operand 5 states and 653 transitions. [2023-08-29 20:13:43,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 82 transitions, 414 flow [2023-08-29 20:13:43,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 82 transitions, 408 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:13:43,991 INFO L231 Difference]: Finished difference. Result has 62 places, 36 transitions, 153 flow [2023-08-29 20:13:43,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=62, PETRI_TRANSITIONS=36} [2023-08-29 20:13:43,992 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 8 predicate places. [2023-08-29 20:13:43,992 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 36 transitions, 153 flow [2023-08-29 20:13:43,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:43,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:13:43,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:13:43,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:13:43,993 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:13:43,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:13:43,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1450839797, now seen corresponding path program 1 times [2023-08-29 20:13:43,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:13:43,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002109147] [2023-08-29 20:13:43,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:13:43,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:13:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:13:44,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:13:44,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:13:44,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002109147] [2023-08-29 20:13:44,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002109147] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:13:44,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:13:44,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:13:44,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144590766] [2023-08-29 20:13:44,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:13:44,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:13:44,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:13:44,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:13:44,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:13:44,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 272 [2023-08-29 20:13:44,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 36 transitions, 153 flow. Second operand has 7 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:44,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:13:44,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 272 [2023-08-29 20:13:44,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:13:45,799 INFO L130 PetriNetUnfolder]: 7735/11188 cut-off events. [2023-08-29 20:13:45,799 INFO L131 PetriNetUnfolder]: For 9294/9294 co-relation queries the response was YES. [2023-08-29 20:13:45,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25567 conditions, 11188 events. 7735/11188 cut-off events. For 9294/9294 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 67054 event pairs, 968 based on Foata normal form. 384/11524 useless extension candidates. Maximal degree in co-relation 25553. Up to 7032 conditions per place. [2023-08-29 20:13:45,860 INFO L137 encePairwiseOnDemand]: 266/272 looper letters, 49 selfloop transitions, 6 changer transitions 2/63 dead transitions. [2023-08-29 20:13:45,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 301 flow [2023-08-29 20:13:45,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:13:45,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:13:45,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 841 transitions. [2023-08-29 20:13:45,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4417016806722689 [2023-08-29 20:13:45,864 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 841 transitions. [2023-08-29 20:13:45,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 841 transitions. [2023-08-29 20:13:45,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:13:45,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 841 transitions. [2023-08-29 20:13:45,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.14285714285714) internal successors, (841), 7 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:45,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:45,871 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:45,871 INFO L175 Difference]: Start difference. First operand has 62 places, 36 transitions, 153 flow. Second operand 7 states and 841 transitions. [2023-08-29 20:13:45,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 301 flow [2023-08-29 20:13:45,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 63 transitions, 284 flow, removed 2 selfloop flow, removed 8 redundant places. [2023-08-29 20:13:45,976 INFO L231 Difference]: Finished difference. Result has 57 places, 32 transitions, 110 flow [2023-08-29 20:13:45,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=110, PETRI_PLACES=57, PETRI_TRANSITIONS=32} [2023-08-29 20:13:45,977 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2023-08-29 20:13:45,978 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 32 transitions, 110 flow [2023-08-29 20:13:45,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:45,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:13:45,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:13:45,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:13:45,979 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:13:45,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:13:45,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1894093157, now seen corresponding path program 1 times [2023-08-29 20:13:45,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:13:45,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756180307] [2023-08-29 20:13:45,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:13:45,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:13:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:13:46,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:13:46,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:13:46,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756180307] [2023-08-29 20:13:46,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756180307] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:13:46,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:13:46,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:13:46,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189829414] [2023-08-29 20:13:46,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:13:46,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:13:46,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:13:46,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:13:46,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:13:46,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 272 [2023-08-29 20:13:46,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 32 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:46,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:13:46,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 272 [2023-08-29 20:13:46,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:13:47,492 INFO L130 PetriNetUnfolder]: 7822/11037 cut-off events. [2023-08-29 20:13:47,492 INFO L131 PetriNetUnfolder]: For 2876/2886 co-relation queries the response was YES. [2023-08-29 20:13:47,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23974 conditions, 11037 events. 7822/11037 cut-off events. For 2876/2886 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 61587 event pairs, 4369 based on Foata normal form. 364/11346 useless extension candidates. Maximal degree in co-relation 23965. Up to 9697 conditions per place. [2023-08-29 20:13:47,530 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 37 selfloop transitions, 5 changer transitions 17/65 dead transitions. [2023-08-29 20:13:47,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 65 transitions, 319 flow [2023-08-29 20:13:47,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:13:47,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:13:47,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 694 transitions. [2023-08-29 20:13:47,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102941176470588 [2023-08-29 20:13:47,533 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 694 transitions. [2023-08-29 20:13:47,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 694 transitions. [2023-08-29 20:13:47,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:13:47,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 694 transitions. [2023-08-29 20:13:47,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.8) internal successors, (694), 5 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:47,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:47,537 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:47,538 INFO L175 Difference]: Start difference. First operand has 57 places, 32 transitions, 110 flow. Second operand 5 states and 694 transitions. [2023-08-29 20:13:47,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 65 transitions, 319 flow [2023-08-29 20:13:47,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 65 transitions, 294 flow, removed 2 selfloop flow, removed 8 redundant places. [2023-08-29 20:13:47,585 INFO L231 Difference]: Finished difference. Result has 54 places, 36 transitions, 138 flow [2023-08-29 20:13:47,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=54, PETRI_TRANSITIONS=36} [2023-08-29 20:13:47,586 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places. [2023-08-29 20:13:47,586 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 36 transitions, 138 flow [2023-08-29 20:13:47,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:47,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:13:47,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:13:47,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:13:47,587 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:13:47,588 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:13:47,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1433141223, now seen corresponding path program 1 times [2023-08-29 20:13:47,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:13:47,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873150005] [2023-08-29 20:13:47,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:13:47,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:13:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:13:48,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:13:48,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:13:48,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873150005] [2023-08-29 20:13:48,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873150005] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:13:48,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:13:48,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:13:48,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212123689] [2023-08-29 20:13:48,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:13:48,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:13:48,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:13:48,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:13:48,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:13:48,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 272 [2023-08-29 20:13:48,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 36 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:48,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:13:48,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 272 [2023-08-29 20:13:48,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:13:49,152 INFO L130 PetriNetUnfolder]: 8114/11572 cut-off events. [2023-08-29 20:13:49,152 INFO L131 PetriNetUnfolder]: For 8138/8592 co-relation queries the response was YES. [2023-08-29 20:13:49,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31148 conditions, 11572 events. 8114/11572 cut-off events. For 8138/8592 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 66380 event pairs, 4044 based on Foata normal form. 432/11944 useless extension candidates. Maximal degree in co-relation 31138. Up to 8956 conditions per place. [2023-08-29 20:13:49,206 INFO L137 encePairwiseOnDemand]: 264/272 looper letters, 55 selfloop transitions, 9 changer transitions 27/97 dead transitions. [2023-08-29 20:13:49,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 97 transitions, 550 flow [2023-08-29 20:13:49,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:13:49,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:13:49,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 955 transitions. [2023-08-29 20:13:49,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5015756302521008 [2023-08-29 20:13:49,210 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 955 transitions. [2023-08-29 20:13:49,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 955 transitions. [2023-08-29 20:13:49,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:13:49,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 955 transitions. [2023-08-29 20:13:49,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.42857142857142) internal successors, (955), 7 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:49,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:49,216 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:49,216 INFO L175 Difference]: Start difference. First operand has 54 places, 36 transitions, 138 flow. Second operand 7 states and 955 transitions. [2023-08-29 20:13:49,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 97 transitions, 550 flow [2023-08-29 20:13:49,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 97 transitions, 543 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:13:49,246 INFO L231 Difference]: Finished difference. Result has 61 places, 42 transitions, 220 flow [2023-08-29 20:13:49,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=220, PETRI_PLACES=61, PETRI_TRANSITIONS=42} [2023-08-29 20:13:49,247 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 7 predicate places. [2023-08-29 20:13:49,247 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 42 transitions, 220 flow [2023-08-29 20:13:49,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:49,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:13:49,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:13:49,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:13:49,248 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:13:49,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:13:49,248 INFO L85 PathProgramCache]: Analyzing trace with hash -394192417, now seen corresponding path program 1 times [2023-08-29 20:13:49,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:13:49,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084573509] [2023-08-29 20:13:49,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:13:49,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:13:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:13:49,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:13:49,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:13:49,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084573509] [2023-08-29 20:13:49,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084573509] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:13:49,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:13:49,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:13:49,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594834074] [2023-08-29 20:13:49,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:13:49,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:13:49,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:13:49,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:13:49,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:13:49,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 272 [2023-08-29 20:13:49,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 42 transitions, 220 flow. Second operand has 7 states, 7 states have (on average 115.57142857142857) internal successors, (809), 7 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:49,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:13:49,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 272 [2023-08-29 20:13:49,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:13:52,351 INFO L130 PetriNetUnfolder]: 23663/32018 cut-off events. [2023-08-29 20:13:52,351 INFO L131 PetriNetUnfolder]: For 53884/53884 co-relation queries the response was YES. [2023-08-29 20:13:52,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101027 conditions, 32018 events. 23663/32018 cut-off events. For 53884/53884 co-relation queries the response was YES. Maximal size of possible extension queue 862. Compared 170902 event pairs, 9244 based on Foata normal form. 616/32634 useless extension candidates. Maximal degree in co-relation 101013. Up to 25442 conditions per place. [2023-08-29 20:13:52,534 INFO L137 encePairwiseOnDemand]: 261/272 looper letters, 71 selfloop transitions, 15 changer transitions 24/110 dead transitions. [2023-08-29 20:13:52,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 110 transitions, 736 flow [2023-08-29 20:13:52,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:13:52,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:13:52,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 887 transitions. [2023-08-29 20:13:52,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46586134453781514 [2023-08-29 20:13:52,537 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 887 transitions. [2023-08-29 20:13:52,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 887 transitions. [2023-08-29 20:13:52,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:13:52,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 887 transitions. [2023-08-29 20:13:52,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.71428571428571) internal successors, (887), 7 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:52,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:52,543 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:52,543 INFO L175 Difference]: Start difference. First operand has 61 places, 42 transitions, 220 flow. Second operand 7 states and 887 transitions. [2023-08-29 20:13:52,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 110 transitions, 736 flow [2023-08-29 20:13:53,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 110 transitions, 704 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-08-29 20:13:53,011 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 335 flow [2023-08-29 20:13:53,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=335, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2023-08-29 20:13:53,011 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 12 predicate places. [2023-08-29 20:13:53,011 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 335 flow [2023-08-29 20:13:53,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.57142857142857) internal successors, (809), 7 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:53,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:13:53,012 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-29 20:13:53,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:13:53,013 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:13:53,013 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:13:53,013 INFO L85 PathProgramCache]: Analyzing trace with hash 664854663, now seen corresponding path program 1 times [2023-08-29 20:13:53,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:13:53,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144035484] [2023-08-29 20:13:53,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:13:53,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:13:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:13:53,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:13:53,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:13:53,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144035484] [2023-08-29 20:13:53,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144035484] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:13:53,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:13:53,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:13:53,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083288429] [2023-08-29 20:13:53,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:13:53,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:13:53,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:13:53,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:13:53,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:13:53,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 272 [2023-08-29 20:13:53,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 335 flow. Second operand has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:53,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:13:53,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 272 [2023-08-29 20:13:53,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:13:56,233 INFO L130 PetriNetUnfolder]: 24802/33589 cut-off events. [2023-08-29 20:13:56,233 INFO L131 PetriNetUnfolder]: For 90363/90363 co-relation queries the response was YES. [2023-08-29 20:13:56,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123042 conditions, 33589 events. 24802/33589 cut-off events. For 90363/90363 co-relation queries the response was YES. Maximal size of possible extension queue 918. Compared 180588 event pairs, 9084 based on Foata normal form. 516/34105 useless extension candidates. Maximal degree in co-relation 123025. Up to 26609 conditions per place. [2023-08-29 20:13:56,737 INFO L137 encePairwiseOnDemand]: 259/272 looper letters, 103 selfloop transitions, 22 changer transitions 30/155 dead transitions. [2023-08-29 20:13:56,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 155 transitions, 1220 flow [2023-08-29 20:13:56,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:13:56,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:13:56,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1028 transitions. [2023-08-29 20:13:56,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4724264705882353 [2023-08-29 20:13:56,741 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1028 transitions. [2023-08-29 20:13:56,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1028 transitions. [2023-08-29 20:13:56,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:13:56,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1028 transitions. [2023-08-29 20:13:56,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 128.5) internal successors, (1028), 8 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:56,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 272.0) internal successors, (2448), 9 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:56,747 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 272.0) internal successors, (2448), 9 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:56,748 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 335 flow. Second operand 8 states and 1028 transitions. [2023-08-29 20:13:56,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 155 transitions, 1220 flow [2023-08-29 20:13:56,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 155 transitions, 1197 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-08-29 20:13:56,936 INFO L231 Difference]: Finished difference. Result has 74 places, 67 transitions, 530 flow [2023-08-29 20:13:56,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=530, PETRI_PLACES=74, PETRI_TRANSITIONS=67} [2023-08-29 20:13:56,937 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 20 predicate places. [2023-08-29 20:13:56,937 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 530 flow [2023-08-29 20:13:56,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:56,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:13:56,938 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-29 20:13:56,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:13:56,938 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:13:56,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:13:56,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1225396729, now seen corresponding path program 2 times [2023-08-29 20:13:56,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:13:56,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132481124] [2023-08-29 20:13:56,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:13:56,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:13:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:13:57,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:13:57,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:13:57,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132481124] [2023-08-29 20:13:57,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132481124] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:13:57,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:13:57,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:13:57,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782358353] [2023-08-29 20:13:57,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:13:57,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:13:57,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:13:57,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:13:57,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:13:57,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 272 [2023-08-29 20:13:57,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 530 flow. Second operand has 7 states, 7 states have (on average 129.42857142857142) internal successors, (906), 7 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:13:57,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:13:57,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 272 [2023-08-29 20:13:57,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:14:00,401 INFO L130 PetriNetUnfolder]: 15880/23260 cut-off events. [2023-08-29 20:14:00,401 INFO L131 PetriNetUnfolder]: For 115571/119242 co-relation queries the response was YES. [2023-08-29 20:14:00,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99683 conditions, 23260 events. 15880/23260 cut-off events. For 115571/119242 co-relation queries the response was YES. Maximal size of possible extension queue 963. Compared 148270 event pairs, 6451 based on Foata normal form. 568/23059 useless extension candidates. Maximal degree in co-relation 99662. Up to 16650 conditions per place. [2023-08-29 20:14:00,556 INFO L137 encePairwiseOnDemand]: 267/272 looper letters, 73 selfloop transitions, 10 changer transitions 16/117 dead transitions. [2023-08-29 20:14:00,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 117 transitions, 1021 flow [2023-08-29 20:14:00,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:14:00,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:14:00,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 836 transitions. [2023-08-29 20:14:00,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5122549019607843 [2023-08-29 20:14:00,559 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 836 transitions. [2023-08-29 20:14:00,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 836 transitions. [2023-08-29 20:14:00,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:14:00,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 836 transitions. [2023-08-29 20:14:00,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.33333333333334) internal successors, (836), 6 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:00,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:00,564 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:00,564 INFO L175 Difference]: Start difference. First operand has 74 places, 67 transitions, 530 flow. Second operand 6 states and 836 transitions. [2023-08-29 20:14:00,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 117 transitions, 1021 flow [2023-08-29 20:14:00,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 117 transitions, 991 flow, removed 11 selfloop flow, removed 3 redundant places. [2023-08-29 20:14:00,779 INFO L231 Difference]: Finished difference. Result has 76 places, 67 transitions, 533 flow [2023-08-29 20:14:00,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=533, PETRI_PLACES=76, PETRI_TRANSITIONS=67} [2023-08-29 20:14:00,780 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 22 predicate places. [2023-08-29 20:14:00,780 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 67 transitions, 533 flow [2023-08-29 20:14:00,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 129.42857142857142) internal successors, (906), 7 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:00,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:14:00,781 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-29 20:14:00,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:14:00,781 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:14:00,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:14:00,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1872960424, now seen corresponding path program 1 times [2023-08-29 20:14:00,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:14:00,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877192253] [2023-08-29 20:14:00,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:14:00,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:14:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:14:01,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:14:01,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:14:01,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877192253] [2023-08-29 20:14:01,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877192253] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:14:01,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:14:01,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:14:01,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413456989] [2023-08-29 20:14:01,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:14:01,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:14:01,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:14:01,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:14:01,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:14:01,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 272 [2023-08-29 20:14:01,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 67 transitions, 533 flow. Second operand has 5 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:01,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:14:01,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 272 [2023-08-29 20:14:01,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:14:02,724 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][110], [288#(= ~y~0 1), Black: 191#(= ~__unbuffered_p2_EAX~0 0), Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), 273#true, 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork0InUse, 7#L841true, 46#P2EXITtrue, Black: 281#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), P2Thread1of1ForFork2InUse, 68#L758true, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 108#L876true, 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), 13#L785true, Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:14:02,725 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:14:02,725 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:14:02,725 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:14:02,725 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:14:02,731 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][110], [288#(= ~y~0 1), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 273#true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 7#L841true, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork0InUse, Black: 281#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 68#L758true, Black: 279#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), P2Thread1of1ForFork2InUse, 122#L818true, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 108#L876true, 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 13#L785true, 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:14:02,731 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-29 20:14:02,731 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:14:02,731 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:14:02,731 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:14:03,038 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][114], [292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 273#true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 7#L841true, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork0InUse, Black: 281#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 68#L758true, Black: 279#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), P2Thread1of1ForFork2InUse, 23#L788true, 122#L818true, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 108#L876true, 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:14:03,038 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:14:03,039 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:14:03,039 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:14:03,039 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:14:03,041 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][110], [288#(= ~y~0 1), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 273#true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 7#L841true, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork0InUse, 46#P2EXITtrue, Black: 281#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 68#L758true, Black: 279#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), P2Thread1of1ForFork2InUse, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 108#L876true, 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 13#L785true, 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:14:03,041 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:14:03,041 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:14:03,042 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:14:03,042 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:14:03,042 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:14:03,215 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][114], [292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 273#true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork0InUse, 7#L841true, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 46#P2EXITtrue, Black: 281#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 68#L758true, Black: 279#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), P2Thread1of1ForFork2InUse, 23#L788true, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 108#L876true, 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 184#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:14:03,215 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-29 20:14:03,215 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:14:03,215 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:14:03,216 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:14:03,396 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][114], [292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 273#true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork0InUse, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 7#L841true, 46#P2EXITtrue, Black: 281#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), P2Thread1of1ForFork2InUse, 68#L758true, 23#L788true, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 108#L876true, 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 184#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:14:03,396 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-29 20:14:03,396 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:14:03,397 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:14:03,397 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:14:03,397 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:14:03,405 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][114], [292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 273#true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 7#L841true, P3Thread1of1ForFork0InUse, 46#P2EXITtrue, Black: 281#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 68#L758true, Black: 279#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), P2Thread1of1ForFork2InUse, 23#L788true, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 108#L876true, 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:14:03,406 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-29 20:14:03,406 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:14:03,406 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:14:03,406 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:14:04,805 INFO L130 PetriNetUnfolder]: 23399/33837 cut-off events. [2023-08-29 20:14:04,805 INFO L131 PetriNetUnfolder]: For 187221/192627 co-relation queries the response was YES. [2023-08-29 20:14:04,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147607 conditions, 33837 events. 23399/33837 cut-off events. For 187221/192627 co-relation queries the response was YES. Maximal size of possible extension queue 1456. Compared 227784 event pairs, 6071 based on Foata normal form. 1443/34182 useless extension candidates. Maximal degree in co-relation 147585. Up to 15702 conditions per place. [2023-08-29 20:14:05,087 INFO L137 encePairwiseOnDemand]: 268/272 looper letters, 94 selfloop transitions, 3 changer transitions 14/133 dead transitions. [2023-08-29 20:14:05,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 133 transitions, 1208 flow [2023-08-29 20:14:05,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:14:05,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:14:05,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 690 transitions. [2023-08-29 20:14:05,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5073529411764706 [2023-08-29 20:14:05,090 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 690 transitions. [2023-08-29 20:14:05,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 690 transitions. [2023-08-29 20:14:05,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:14:05,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 690 transitions. [2023-08-29 20:14:05,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.0) internal successors, (690), 5 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:05,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:05,093 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:05,093 INFO L175 Difference]: Start difference. First operand has 76 places, 67 transitions, 533 flow. Second operand 5 states and 690 transitions. [2023-08-29 20:14:05,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 133 transitions, 1208 flow [2023-08-29 20:14:05,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 133 transitions, 1169 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-08-29 20:14:05,615 INFO L231 Difference]: Finished difference. Result has 77 places, 69 transitions, 539 flow [2023-08-29 20:14:05,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=539, PETRI_PLACES=77, PETRI_TRANSITIONS=69} [2023-08-29 20:14:05,616 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 23 predicate places. [2023-08-29 20:14:05,616 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 69 transitions, 539 flow [2023-08-29 20:14:05,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:05,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:14:05,617 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-29 20:14:05,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:14:05,617 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:14:05,617 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:14:05,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1901069766, now seen corresponding path program 2 times [2023-08-29 20:14:05,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:14:05,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949676775] [2023-08-29 20:14:05,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:14:05,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:14:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:14:05,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:14:05,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:14:05,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949676775] [2023-08-29 20:14:05,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949676775] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:14:05,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:14:05,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:14:05,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516926999] [2023-08-29 20:14:05,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:14:05,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:14:05,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:14:05,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:14:05,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:14:05,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 272 [2023-08-29 20:14:05,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 69 transitions, 539 flow. Second operand has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:05,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:14:05,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 272 [2023-08-29 20:14:05,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:14:07,014 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][135], [288#(= ~y~0 1), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 302#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 61#L869true, P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork0InUse, 7#L841true, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 46#P2EXITtrue, P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, 68#L758true, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 294#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), 13#L785true, Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:14:07,014 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-29 20:14:07,014 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:14:07,014 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:14:07,014 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:14:07,068 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([497] L876-->L893: Formula: (let ((.cse4 (= (mod v_~x$r_buff1_thd0~0_68 256) 0)) (.cse8 (= (mod v_~x$r_buff0_thd0~0_70 256) 0))) (let ((.cse9 (not .cse8)) (.cse13 (= (mod v_~x$w_buff0_used~0_174 256) 0)) (.cse5 (and .cse8 .cse4)) (.cse6 (and .cse8 (= 0 (mod v_~x$w_buff1_used~0_147 256))))) (let ((.cse11 (or .cse13 .cse5 .cse6)) (.cse12 (and (not .cse13) .cse9))) (let ((.cse2 (= (mod v_~x$w_buff1_used~0_146 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_173 256) 0)) (.cse7 (ite .cse11 v_~x~0_100 (ite .cse12 v_~x$w_buff0~0_91 v_~x$w_buff1~0_70))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0)))) (and (= v_~x$r_buff1_thd0~0_67 (ite .cse0 v_~x$r_buff1_thd0~0_68 (ite (let ((.cse3 (= (mod v_~x$r_buff0_thd0~0_69 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse3 .cse4))) v_~x$r_buff1_thd0~0_68 0))) (= v_~x$w_buff1~0_69 v_~x$w_buff1~0_70) (= v_~x$mem_tmp~0_24 v_~x~0_100) (= v_~x$w_buff1_used~0_146 (ite .cse0 v_~x$w_buff1_used~0_147 (ite (or .cse1 .cse5 .cse6) v_~x$w_buff1_used~0_147 0))) (= v_~x$w_buff0~0_91 v_~x$w_buff0~0_90) (= (ite .cse0 v_~x$mem_tmp~0_24 .cse7) v_~x~0_99) (= (ite .cse0 v_~x$r_buff0_thd0~0_70 (ite (or .cse1 .cse5 (and .cse2 .cse8)) v_~x$r_buff0_thd0~0_70 (ite (and (not .cse1) .cse9) 0 v_~x$r_buff0_thd0~0_70))) v_~x$r_buff0_thd0~0_69) (= (ite (= (ite (not (and (= 2 .cse7) (= v_~__unbuffered_p3_EAX~0_14 1) (= v_~__unbuffered_p1_EAX~0_16 0) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~__unbuffered_p2_EAX~0_16 1) (= 0 v_~__unbuffered_p3_EBX~0_16))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_16) (= v_~x$flush_delayed~0_33 0) (= (let ((.cse10 (mod (mod v_~main$tmp_guard1~0_16 256) 4294967296))) (ite (<= .cse10 2147483647) .cse10 (+ .cse10 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|) (= (ite .cse0 v_~x$w_buff0_used~0_174 (ite .cse11 v_~x$w_buff0_used~0_174 (ite .cse12 0 v_~x$w_buff0_used~0_174))) v_~x$w_buff0_used~0_173)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~x$w_buff1~0=v_~x$w_buff1~0_70, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_147, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_68, ~x~0=v_~x~0_100, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_174} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~x$flush_delayed~0=v_~x$flush_delayed~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_69, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_146, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_67, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_33|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_173, ~weak$$choice0~0=v_~weak$$choice0~0_15, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_23|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x~0=v_~x~0_99} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~weak$$choice2~0, ~x~0][146], [299#true, 288#(= ~y~0 1), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 107#L831true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, 110#L811true, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 294#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), 112#P0EXITtrue, 85#L893true, Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 13#L785true, 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 184#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:14:07,068 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-29 20:14:07,069 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:14:07,069 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:14:07,069 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:14:07,069 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([428] L811-->L818: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_81 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_82 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse2 0 v_~x$w_buff0_used~0_82) v_~x$w_buff0_used~0_81) (= v_~x~0_39 (ite .cse2 v_~x$w_buff0~0_22 (ite .cse3 v_~x$w_buff1~0_17 v_~x~0_40))) (= v_~x$w_buff1_used~0_70 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_71)) (= v_~x$r_buff0_thd3~0_21 (ite .cse4 0 v_~x$r_buff0_thd3~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][81], [299#true, 288#(= ~y~0 1), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 107#L831true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, 122#L818true, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 294#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 108#L876true, 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), 112#P0EXITtrue, Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 13#L785true, 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 184#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:14:07,070 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-29 20:14:07,070 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:14:07,070 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:14:07,070 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:14:07,072 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][123], [299#true, 288#(= ~y~0 1), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 50#L808true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork0InUse, 7#L841true, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 294#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 108#L876true, 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), 112#P0EXITtrue, Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 13#L785true, 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 184#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:14:07,072 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-29 20:14:07,072 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:14:07,072 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:14:07,072 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:14:07,073 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([497] L876-->L893: Formula: (let ((.cse4 (= (mod v_~x$r_buff1_thd0~0_68 256) 0)) (.cse8 (= (mod v_~x$r_buff0_thd0~0_70 256) 0))) (let ((.cse9 (not .cse8)) (.cse13 (= (mod v_~x$w_buff0_used~0_174 256) 0)) (.cse5 (and .cse8 .cse4)) (.cse6 (and .cse8 (= 0 (mod v_~x$w_buff1_used~0_147 256))))) (let ((.cse11 (or .cse13 .cse5 .cse6)) (.cse12 (and (not .cse13) .cse9))) (let ((.cse2 (= (mod v_~x$w_buff1_used~0_146 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_173 256) 0)) (.cse7 (ite .cse11 v_~x~0_100 (ite .cse12 v_~x$w_buff0~0_91 v_~x$w_buff1~0_70))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0)))) (and (= v_~x$r_buff1_thd0~0_67 (ite .cse0 v_~x$r_buff1_thd0~0_68 (ite (let ((.cse3 (= (mod v_~x$r_buff0_thd0~0_69 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse3 .cse4))) v_~x$r_buff1_thd0~0_68 0))) (= v_~x$w_buff1~0_69 v_~x$w_buff1~0_70) (= v_~x$mem_tmp~0_24 v_~x~0_100) (= v_~x$w_buff1_used~0_146 (ite .cse0 v_~x$w_buff1_used~0_147 (ite (or .cse1 .cse5 .cse6) v_~x$w_buff1_used~0_147 0))) (= v_~x$w_buff0~0_91 v_~x$w_buff0~0_90) (= (ite .cse0 v_~x$mem_tmp~0_24 .cse7) v_~x~0_99) (= (ite .cse0 v_~x$r_buff0_thd0~0_70 (ite (or .cse1 .cse5 (and .cse2 .cse8)) v_~x$r_buff0_thd0~0_70 (ite (and (not .cse1) .cse9) 0 v_~x$r_buff0_thd0~0_70))) v_~x$r_buff0_thd0~0_69) (= (ite (= (ite (not (and (= 2 .cse7) (= v_~__unbuffered_p3_EAX~0_14 1) (= v_~__unbuffered_p1_EAX~0_16 0) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~__unbuffered_p2_EAX~0_16 1) (= 0 v_~__unbuffered_p3_EBX~0_16))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_16) (= v_~x$flush_delayed~0_33 0) (= (let ((.cse10 (mod (mod v_~main$tmp_guard1~0_16 256) 4294967296))) (ite (<= .cse10 2147483647) .cse10 (+ .cse10 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|) (= (ite .cse0 v_~x$w_buff0_used~0_174 (ite .cse11 v_~x$w_buff0_used~0_174 (ite .cse12 0 v_~x$w_buff0_used~0_174))) v_~x$w_buff0_used~0_173)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~x$w_buff1~0=v_~x$w_buff1~0_70, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_147, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_68, ~x~0=v_~x~0_100, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_174} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~x$flush_delayed~0=v_~x$flush_delayed~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_69, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_146, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_67, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_33|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_173, ~weak$$choice0~0=v_~weak$$choice0~0_15, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_23|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x~0=v_~x~0_99} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~weak$$choice2~0, ~x~0][146], [299#true, 288#(= ~y~0 1), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 88#L834true, 50#L808true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork0InUse, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 294#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), 112#P0EXITtrue, 85#L893true, Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 13#L785true, 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 184#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:14:07,073 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-29 20:14:07,073 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:14:07,073 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:14:07,073 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:14:07,464 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][123], [299#true, 288#(= ~y~0 1), Black: 191#(= ~__unbuffered_p2_EAX~0 0), Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 7#L841true, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, 110#L811true, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 294#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), 108#L876true, 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), 112#P0EXITtrue, Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 13#L785true, 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 184#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:14:07,464 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:14:07,464 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:14:07,464 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:14:07,465 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:14:07,465 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([497] L876-->L893: Formula: (let ((.cse4 (= (mod v_~x$r_buff1_thd0~0_68 256) 0)) (.cse8 (= (mod v_~x$r_buff0_thd0~0_70 256) 0))) (let ((.cse9 (not .cse8)) (.cse13 (= (mod v_~x$w_buff0_used~0_174 256) 0)) (.cse5 (and .cse8 .cse4)) (.cse6 (and .cse8 (= 0 (mod v_~x$w_buff1_used~0_147 256))))) (let ((.cse11 (or .cse13 .cse5 .cse6)) (.cse12 (and (not .cse13) .cse9))) (let ((.cse2 (= (mod v_~x$w_buff1_used~0_146 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_173 256) 0)) (.cse7 (ite .cse11 v_~x~0_100 (ite .cse12 v_~x$w_buff0~0_91 v_~x$w_buff1~0_70))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0)))) (and (= v_~x$r_buff1_thd0~0_67 (ite .cse0 v_~x$r_buff1_thd0~0_68 (ite (let ((.cse3 (= (mod v_~x$r_buff0_thd0~0_69 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse3 .cse4))) v_~x$r_buff1_thd0~0_68 0))) (= v_~x$w_buff1~0_69 v_~x$w_buff1~0_70) (= v_~x$mem_tmp~0_24 v_~x~0_100) (= v_~x$w_buff1_used~0_146 (ite .cse0 v_~x$w_buff1_used~0_147 (ite (or .cse1 .cse5 .cse6) v_~x$w_buff1_used~0_147 0))) (= v_~x$w_buff0~0_91 v_~x$w_buff0~0_90) (= (ite .cse0 v_~x$mem_tmp~0_24 .cse7) v_~x~0_99) (= (ite .cse0 v_~x$r_buff0_thd0~0_70 (ite (or .cse1 .cse5 (and .cse2 .cse8)) v_~x$r_buff0_thd0~0_70 (ite (and (not .cse1) .cse9) 0 v_~x$r_buff0_thd0~0_70))) v_~x$r_buff0_thd0~0_69) (= (ite (= (ite (not (and (= 2 .cse7) (= v_~__unbuffered_p3_EAX~0_14 1) (= v_~__unbuffered_p1_EAX~0_16 0) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~__unbuffered_p2_EAX~0_16 1) (= 0 v_~__unbuffered_p3_EBX~0_16))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_16) (= v_~x$flush_delayed~0_33 0) (= (let ((.cse10 (mod (mod v_~main$tmp_guard1~0_16 256) 4294967296))) (ite (<= .cse10 2147483647) .cse10 (+ .cse10 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|) (= (ite .cse0 v_~x$w_buff0_used~0_174 (ite .cse11 v_~x$w_buff0_used~0_174 (ite .cse12 0 v_~x$w_buff0_used~0_174))) v_~x$w_buff0_used~0_173)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~x$w_buff1~0=v_~x$w_buff1~0_70, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_147, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_68, ~x~0=v_~x~0_100, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_174} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~x$flush_delayed~0=v_~x$flush_delayed~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_69, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_146, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_67, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_33|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_173, ~weak$$choice0~0=v_~weak$$choice0~0_15, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_23|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x~0=v_~x~0_99} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~weak$$choice2~0, ~x~0][146], [299#true, 288#(= ~y~0 1), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 88#L834true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, 110#L811true, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 294#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), 112#P0EXITtrue, 85#L893true, Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 13#L785true, 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 184#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:14:07,465 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:14:07,465 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:14:07,465 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:14:07,465 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:14:07,484 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][123], [299#true, 288#(= ~y~0 1), Black: 191#(= ~__unbuffered_p2_EAX~0 0), Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork0InUse, 7#L841true, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, 110#L811true, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 294#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 108#L876true, 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), 112#P0EXITtrue, Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), 13#L785true, Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:14:07,484 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:14:07,484 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:14:07,484 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:14:07,484 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:14:07,485 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([497] L876-->L893: Formula: (let ((.cse4 (= (mod v_~x$r_buff1_thd0~0_68 256) 0)) (.cse8 (= (mod v_~x$r_buff0_thd0~0_70 256) 0))) (let ((.cse9 (not .cse8)) (.cse13 (= (mod v_~x$w_buff0_used~0_174 256) 0)) (.cse5 (and .cse8 .cse4)) (.cse6 (and .cse8 (= 0 (mod v_~x$w_buff1_used~0_147 256))))) (let ((.cse11 (or .cse13 .cse5 .cse6)) (.cse12 (and (not .cse13) .cse9))) (let ((.cse2 (= (mod v_~x$w_buff1_used~0_146 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_173 256) 0)) (.cse7 (ite .cse11 v_~x~0_100 (ite .cse12 v_~x$w_buff0~0_91 v_~x$w_buff1~0_70))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0)))) (and (= v_~x$r_buff1_thd0~0_67 (ite .cse0 v_~x$r_buff1_thd0~0_68 (ite (let ((.cse3 (= (mod v_~x$r_buff0_thd0~0_69 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse3 .cse4))) v_~x$r_buff1_thd0~0_68 0))) (= v_~x$w_buff1~0_69 v_~x$w_buff1~0_70) (= v_~x$mem_tmp~0_24 v_~x~0_100) (= v_~x$w_buff1_used~0_146 (ite .cse0 v_~x$w_buff1_used~0_147 (ite (or .cse1 .cse5 .cse6) v_~x$w_buff1_used~0_147 0))) (= v_~x$w_buff0~0_91 v_~x$w_buff0~0_90) (= (ite .cse0 v_~x$mem_tmp~0_24 .cse7) v_~x~0_99) (= (ite .cse0 v_~x$r_buff0_thd0~0_70 (ite (or .cse1 .cse5 (and .cse2 .cse8)) v_~x$r_buff0_thd0~0_70 (ite (and (not .cse1) .cse9) 0 v_~x$r_buff0_thd0~0_70))) v_~x$r_buff0_thd0~0_69) (= (ite (= (ite (not (and (= 2 .cse7) (= v_~__unbuffered_p3_EAX~0_14 1) (= v_~__unbuffered_p1_EAX~0_16 0) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~__unbuffered_p2_EAX~0_16 1) (= 0 v_~__unbuffered_p3_EBX~0_16))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_16) (= v_~x$flush_delayed~0_33 0) (= (let ((.cse10 (mod (mod v_~main$tmp_guard1~0_16 256) 4294967296))) (ite (<= .cse10 2147483647) .cse10 (+ .cse10 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|) (= (ite .cse0 v_~x$w_buff0_used~0_174 (ite .cse11 v_~x$w_buff0_used~0_174 (ite .cse12 0 v_~x$w_buff0_used~0_174))) v_~x$w_buff0_used~0_173)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~x$w_buff1~0=v_~x$w_buff1~0_70, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_147, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_68, ~x~0=v_~x~0_100, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_174} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~x$flush_delayed~0=v_~x$flush_delayed~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_69, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_146, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_67, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_33|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_173, ~weak$$choice0~0=v_~weak$$choice0~0_15, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_23|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x~0=v_~x~0_99} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~weak$$choice2~0, ~x~0][146], [299#true, 288#(= ~y~0 1), 88#L834true, Black: 191#(= ~__unbuffered_p2_EAX~0 0), Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork0InUse, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, 110#L811true, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 294#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), 112#P0EXITtrue, 85#L893true, Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), 13#L785true, Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:14:07,485 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:14:07,485 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:14:07,485 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:14:07,485 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:14:07,925 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][123], [299#true, 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 95#L795true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork0InUse, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 7#L841true, P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, 110#L811true, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 288#(= ~y~0 1), Black: 294#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 108#L876true, 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), 112#P0EXITtrue, Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:14:07,925 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-29 20:14:07,925 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 20:14:07,926 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 20:14:07,926 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 20:14:08,261 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][123], [299#true, 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 191#(= ~__unbuffered_p2_EAX~0 0), Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork0InUse, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 7#L841true, P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, 110#L811true, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 288#(= ~y~0 1), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 294#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 108#L876true, 117#P1EXITtrue, 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), 112#P0EXITtrue, Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:14:08,261 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-29 20:14:08,261 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 20:14:08,262 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 20:14:08,262 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 20:14:08,632 INFO L130 PetriNetUnfolder]: 17970/26520 cut-off events. [2023-08-29 20:14:08,632 INFO L131 PetriNetUnfolder]: For 147585/153241 co-relation queries the response was YES. [2023-08-29 20:14:08,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112914 conditions, 26520 events. 17970/26520 cut-off events. For 147585/153241 co-relation queries the response was YES. Maximal size of possible extension queue 1544. Compared 186603 event pairs, 4631 based on Foata normal form. 3015/28652 useless extension candidates. Maximal degree in co-relation 112891. Up to 16737 conditions per place. [2023-08-29 20:14:08,828 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 118 selfloop transitions, 10 changer transitions 2/156 dead transitions. [2023-08-29 20:14:08,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 156 transitions, 1392 flow [2023-08-29 20:14:08,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:14:08,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:14:08,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 689 transitions. [2023-08-29 20:14:08,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5066176470588235 [2023-08-29 20:14:08,831 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 689 transitions. [2023-08-29 20:14:08,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 689 transitions. [2023-08-29 20:14:08,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:14:08,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 689 transitions. [2023-08-29 20:14:08,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.8) internal successors, (689), 5 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:08,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:08,836 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:08,836 INFO L175 Difference]: Start difference. First operand has 77 places, 69 transitions, 539 flow. Second operand 5 states and 689 transitions. [2023-08-29 20:14:08,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 156 transitions, 1392 flow [2023-08-29 20:14:08,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 156 transitions, 1386 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:14:08,925 INFO L231 Difference]: Finished difference. Result has 81 places, 78 transitions, 615 flow [2023-08-29 20:14:08,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=615, PETRI_PLACES=81, PETRI_TRANSITIONS=78} [2023-08-29 20:14:08,926 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 27 predicate places. [2023-08-29 20:14:08,926 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 78 transitions, 615 flow [2023-08-29 20:14:08,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:08,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:14:08,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:14:08,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 20:14:08,927 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:14:08,927 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:14:08,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1800368502, now seen corresponding path program 1 times [2023-08-29 20:14:08,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:14:08,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301732919] [2023-08-29 20:14:08,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:14:08,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:14:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:14:09,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:14:09,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:14:09,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301732919] [2023-08-29 20:14:09,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301732919] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:14:09,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:14:09,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:14:09,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481397826] [2023-08-29 20:14:09,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:14:09,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:14:09,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:14:09,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:14:09,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:14:09,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 272 [2023-08-29 20:14:09,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 78 transitions, 615 flow. Second operand has 5 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:09,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:14:09,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 272 [2023-08-29 20:14:09,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:14:10,547 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][142], [288#(= ~y~0 1), 302#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 191#(= ~__unbuffered_p2_EAX~0 0), Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 317#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 61#L869true, P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 7#L841true, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork0InUse, 46#P2EXITtrue, P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, 68#L758true, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), Black: 301#(= ~__unbuffered_cnt~0 0), Black: 304#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), 13#L785true, Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:14:10,547 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-29 20:14:10,547 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:14:10,547 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:14:10,548 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:14:11,699 INFO L130 PetriNetUnfolder]: 13613/20775 cut-off events. [2023-08-29 20:14:11,699 INFO L131 PetriNetUnfolder]: For 115724/120646 co-relation queries the response was YES. [2023-08-29 20:14:11,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99187 conditions, 20775 events. 13613/20775 cut-off events. For 115724/120646 co-relation queries the response was YES. Maximal size of possible extension queue 1268. Compared 150497 event pairs, 1487 based on Foata normal form. 2230/22418 useless extension candidates. Maximal degree in co-relation 99162. Up to 7410 conditions per place. [2023-08-29 20:14:11,843 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 150 selfloop transitions, 19 changer transitions 9/204 dead transitions. [2023-08-29 20:14:11,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 204 transitions, 1916 flow [2023-08-29 20:14:11,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:14:11,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:14:11,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 966 transitions. [2023-08-29 20:14:11,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5073529411764706 [2023-08-29 20:14:11,847 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 966 transitions. [2023-08-29 20:14:11,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 966 transitions. [2023-08-29 20:14:11,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:14:11,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 966 transitions. [2023-08-29 20:14:11,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 138.0) internal successors, (966), 7 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:11,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:11,852 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:11,852 INFO L175 Difference]: Start difference. First operand has 81 places, 78 transitions, 615 flow. Second operand 7 states and 966 transitions. [2023-08-29 20:14:11,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 204 transitions, 1916 flow [2023-08-29 20:14:11,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 204 transitions, 1911 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:14:11,991 INFO L231 Difference]: Finished difference. Result has 89 places, 87 transitions, 748 flow [2023-08-29 20:14:11,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=748, PETRI_PLACES=89, PETRI_TRANSITIONS=87} [2023-08-29 20:14:11,991 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 35 predicate places. [2023-08-29 20:14:11,991 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 87 transitions, 748 flow [2023-08-29 20:14:11,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:11,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:14:11,992 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-29 20:14:11,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 20:14:11,993 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:14:11,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:14:11,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1731324700, now seen corresponding path program 1 times [2023-08-29 20:14:11,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:14:11,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343567922] [2023-08-29 20:14:11,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:14:11,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:14:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:14:12,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:14:12,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:14:12,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343567922] [2023-08-29 20:14:12,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343567922] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:14:12,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:14:12,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:14:12,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124890194] [2023-08-29 20:14:12,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:14:12,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:14:12,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:14:12,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:14:12,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:14:12,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 272 [2023-08-29 20:14:12,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 87 transitions, 748 flow. Second operand has 6 states, 6 states have (on average 116.83333333333333) internal successors, (701), 6 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-29 20:14:12,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:14:12,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 272 [2023-08-29 20:14:12,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:14:17,497 INFO L130 PetriNetUnfolder]: 31150/45458 cut-off events. [2023-08-29 20:14:17,497 INFO L131 PetriNetUnfolder]: For 251235/255437 co-relation queries the response was YES. [2023-08-29 20:14:17,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236418 conditions, 45458 events. 31150/45458 cut-off events. For 251235/255437 co-relation queries the response was YES. Maximal size of possible extension queue 2043. Compared 318515 event pairs, 2030 based on Foata normal form. 1968/47395 useless extension candidates. Maximal degree in co-relation 236390. Up to 23185 conditions per place. [2023-08-29 20:14:17,869 INFO L137 encePairwiseOnDemand]: 263/272 looper letters, 135 selfloop transitions, 18 changer transitions 66/225 dead transitions. [2023-08-29 20:14:17,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 225 transitions, 2319 flow [2023-08-29 20:14:17,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:14:17,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:14:17,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 883 transitions. [2023-08-29 20:14:17,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4637605042016807 [2023-08-29 20:14:17,871 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 883 transitions. [2023-08-29 20:14:17,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 883 transitions. [2023-08-29 20:14:17,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:14:17,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 883 transitions. [2023-08-29 20:14:17,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:17,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:17,875 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:17,875 INFO L175 Difference]: Start difference. First operand has 89 places, 87 transitions, 748 flow. Second operand 7 states and 883 transitions. [2023-08-29 20:14:17,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 225 transitions, 2319 flow [2023-08-29 20:14:20,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 225 transitions, 2180 flow, removed 47 selfloop flow, removed 3 redundant places. [2023-08-29 20:14:20,544 INFO L231 Difference]: Finished difference. Result has 97 places, 91 transitions, 820 flow [2023-08-29 20:14:20,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=820, PETRI_PLACES=97, PETRI_TRANSITIONS=91} [2023-08-29 20:14:20,545 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 43 predicate places. [2023-08-29 20:14:20,545 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 91 transitions, 820 flow [2023-08-29 20:14:20,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.83333333333333) internal successors, (701), 6 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-29 20:14:20,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:14:20,546 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-29 20:14:20,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 20:14:20,546 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:14:20,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:14:20,546 INFO L85 PathProgramCache]: Analyzing trace with hash -692326960, now seen corresponding path program 2 times [2023-08-29 20:14:20,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:14:20,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451741586] [2023-08-29 20:14:20,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:14:20,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:14:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:14:20,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:14:20,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:14:20,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451741586] [2023-08-29 20:14:20,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451741586] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:14:20,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:14:20,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:14:20,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611684870] [2023-08-29 20:14:20,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:14:20,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:14:20,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:14:20,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:14:20,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:14:20,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 272 [2023-08-29 20:14:20,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 91 transitions, 820 flow. Second operand has 6 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:20,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:14:20,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 272 [2023-08-29 20:14:20,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:14:22,156 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][141], [Black: 312#(<= ~__unbuffered_cnt~0 1), Black: 313#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 288#(= ~y~0 1), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 50#L808true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), Black: 326#(and (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))))), 317#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 329#(and (= ~z~0 1) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))))), Black: 332#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 61#L869true, Black: 335#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 7#L841true, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 352#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), Black: 302#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 112#P0EXITtrue, 324#(= ~z~0 1), Black: 301#(= ~__unbuffered_cnt~0 0), Black: 304#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), 13#L785true, Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 184#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:14:22,156 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-29 20:14:22,156 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 20:14:22,157 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 20:14:22,157 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 20:14:22,158 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([428] L811-->L818: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_81 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_82 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse2 0 v_~x$w_buff0_used~0_82) v_~x$w_buff0_used~0_81) (= v_~x~0_39 (ite .cse2 v_~x$w_buff0~0_22 (ite .cse3 v_~x$w_buff1~0_17 v_~x~0_40))) (= v_~x$w_buff1_used~0_70 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_71)) (= v_~x$r_buff0_thd3~0_21 (ite .cse4 0 v_~x$r_buff0_thd3~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][134], [Black: 312#(<= ~__unbuffered_cnt~0 1), Black: 313#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 288#(= ~y~0 1), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 107#L831true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), Black: 326#(and (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))))), Black: 329#(and (= ~z~0 1) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))))), 317#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 324#(= ~z~0 1), 61#L869true, Black: 335#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 122#L818true, Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 352#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), Black: 302#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 112#P0EXITtrue, Black: 301#(= ~__unbuffered_cnt~0 0), Black: 304#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 332#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), 13#L785true, Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 184#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:14:22,158 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-29 20:14:22,158 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 20:14:22,158 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 20:14:22,158 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 20:14:22,409 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([428] L811-->L818: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_81 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_82 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse2 0 v_~x$w_buff0_used~0_82) v_~x$w_buff0_used~0_81) (= v_~x~0_39 (ite .cse2 v_~x$w_buff0~0_22 (ite .cse3 v_~x$w_buff1~0_17 v_~x~0_40))) (= v_~x$w_buff1_used~0_70 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_71)) (= v_~x$r_buff0_thd3~0_21 (ite .cse4 0 v_~x$r_buff0_thd3~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][134], [Black: 312#(<= ~__unbuffered_cnt~0 1), Black: 313#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 288#(= ~y~0 1), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 88#L834true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), Black: 326#(and (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))))), 317#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 329#(and (= ~z~0 1) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))))), Black: 324#(= ~z~0 1), 61#L869true, Black: 335#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork0InUse, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, Black: 221#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 122#L818true, Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 352#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), Black: 302#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 112#P0EXITtrue, Black: 301#(= ~__unbuffered_cnt~0 0), Black: 304#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 332#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), 13#L785true, Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 184#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:14:22,409 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-29 20:14:22,410 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:14:22,410 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:14:22,410 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:14:23,300 INFO L130 PetriNetUnfolder]: 13315/20833 cut-off events. [2023-08-29 20:14:23,301 INFO L131 PetriNetUnfolder]: For 131436/136051 co-relation queries the response was YES. [2023-08-29 20:14:23,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104899 conditions, 20833 events. 13315/20833 cut-off events. For 131436/136051 co-relation queries the response was YES. Maximal size of possible extension queue 1452. Compared 159305 event pairs, 1025 based on Foata normal form. 1703/22028 useless extension candidates. Maximal degree in co-relation 104866. Up to 7974 conditions per place. [2023-08-29 20:14:23,463 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 172 selfloop transitions, 21 changer transitions 20/244 dead transitions. [2023-08-29 20:14:23,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 244 transitions, 2519 flow [2023-08-29 20:14:23,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:14:23,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:14:23,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1234 transitions. [2023-08-29 20:14:23,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5040849673202614 [2023-08-29 20:14:23,466 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1234 transitions. [2023-08-29 20:14:23,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1234 transitions. [2023-08-29 20:14:23,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:14:23,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1234 transitions. [2023-08-29 20:14:23,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 137.11111111111111) internal successors, (1234), 9 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:23,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 272.0) internal successors, (2720), 10 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:23,472 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 272.0) internal successors, (2720), 10 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:23,473 INFO L175 Difference]: Start difference. First operand has 97 places, 91 transitions, 820 flow. Second operand 9 states and 1234 transitions. [2023-08-29 20:14:23,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 244 transitions, 2519 flow [2023-08-29 20:14:24,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 244 transitions, 2473 flow, removed 15 selfloop flow, removed 3 redundant places. [2023-08-29 20:14:24,068 INFO L231 Difference]: Finished difference. Result has 103 places, 99 transitions, 949 flow [2023-08-29 20:14:24,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=949, PETRI_PLACES=103, PETRI_TRANSITIONS=99} [2023-08-29 20:14:24,068 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 49 predicate places. [2023-08-29 20:14:24,068 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 99 transitions, 949 flow [2023-08-29 20:14:24,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:24,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:14:24,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:14:24,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 20:14:24,070 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:14:24,070 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:14:24,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1672008504, now seen corresponding path program 1 times [2023-08-29 20:14:24,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:14:24,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572448614] [2023-08-29 20:14:24,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:14:24,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:14:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:14:24,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:14:24,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:14:24,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572448614] [2023-08-29 20:14:24,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572448614] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:14:24,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:14:24,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:14:24,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840754138] [2023-08-29 20:14:24,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:14:24,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:14:24,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:14:24,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:14:24,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:14:24,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 272 [2023-08-29 20:14:24,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 99 transitions, 949 flow. Second operand has 7 states, 7 states have (on average 127.0) internal successors, (889), 7 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:24,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:14:24,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 272 [2023-08-29 20:14:24,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:14:25,676 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([428] L811-->L818: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_81 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_82 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse2 0 v_~x$w_buff0_used~0_82) v_~x$w_buff0_used~0_81) (= v_~x~0_39 (ite .cse2 v_~x$w_buff0~0_22 (ite .cse3 v_~x$w_buff1~0_17 v_~x~0_40))) (= v_~x$w_buff1_used~0_70 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_71)) (= v_~x$r_buff0_thd3~0_21 (ite .cse4 0 v_~x$r_buff0_thd3~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][134], [Black: 312#(<= ~__unbuffered_cnt~0 1), Black: 313#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 288#(= ~y~0 1), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 107#L831true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), Black: 326#(and (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))))), Black: 329#(and (= ~z~0 1) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))))), 317#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 324#(= ~z~0 1), 61#L869true, P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, 369#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 347#(<= ~__unbuffered_cnt~0 2), Black: 354#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 348#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 122#L818true, Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 352#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), 112#P0EXITtrue, Black: 301#(= ~__unbuffered_cnt~0 0), Black: 304#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 332#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 13#L785true, 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 184#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:14:25,676 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-29 20:14:25,676 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 20:14:25,676 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 20:14:25,676 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 20:14:25,860 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][139], [Black: 312#(<= ~__unbuffered_cnt~0 1), Black: 313#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 288#(= ~y~0 1), Black: 191#(= ~__unbuffered_p2_EAX~0 0), 50#L808true, Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), Black: 326#(and (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))))), Black: 329#(and (= ~z~0 1) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))))), 317#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 332#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 61#L869true, P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 7#L841true, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, 369#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 347#(<= ~__unbuffered_cnt~0 2), Black: 354#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 348#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 352#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), 112#P0EXITtrue, 324#(= ~z~0 1), Black: 301#(= ~__unbuffered_cnt~0 0), Black: 304#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 13#L785true, 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 184#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:14:25,861 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2023-08-29 20:14:25,861 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-29 20:14:25,861 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-29 20:14:25,861 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-29 20:14:26,000 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([428] L811-->L818: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_81 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_82 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse2 0 v_~x$w_buff0_used~0_82) v_~x$w_buff0_used~0_81) (= v_~x~0_39 (ite .cse2 v_~x$w_buff0~0_22 (ite .cse3 v_~x$w_buff1~0_17 v_~x~0_40))) (= v_~x$w_buff1_used~0_70 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_71)) (= v_~x$r_buff0_thd3~0_21 (ite .cse4 0 v_~x$r_buff0_thd3~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][134], [Black: 312#(<= ~__unbuffered_cnt~0 1), Black: 313#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 288#(= ~y~0 1), 88#L834true, Black: 191#(= ~__unbuffered_p2_EAX~0 0), Black: 262#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), 237#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 264#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 258#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), Black: 326#(and (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))))), 317#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 329#(and (= ~z~0 1) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))))), Black: 324#(= ~z~0 1), 61#L869true, P0Thread1of1ForFork1InUse, Black: 214#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork0InUse, Black: 210#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork3InUse, Black: 276#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, 369#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 347#(<= ~__unbuffered_cnt~0 2), Black: 354#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 348#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 122#L818true, Black: 226#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~x~0 ~x$w_buff1~0)), Black: 292#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 352#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 223#(and (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 159#true, 219#true, Black: 168#(= ~__unbuffered_p3_EAX~0 0), 112#P0EXITtrue, Black: 301#(= ~__unbuffered_cnt~0 0), Black: 304#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 332#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 13#L785true, Black: 182#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t147~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (select |#valid| |ULTIMATE.start_main_~#t145~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t146~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 206#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 247#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 184#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), Black: 243#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:14:26,001 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-29 20:14:26,001 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:14:26,001 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:14:26,001 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:14:26,861 INFO L130 PetriNetUnfolder]: 13153/20428 cut-off events. [2023-08-29 20:14:26,862 INFO L131 PetriNetUnfolder]: For 133720/137181 co-relation queries the response was YES. [2023-08-29 20:14:26,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109286 conditions, 20428 events. 13153/20428 cut-off events. For 133720/137181 co-relation queries the response was YES. Maximal size of possible extension queue 1452. Compared 156158 event pairs, 969 based on Foata normal form. 1063/20964 useless extension candidates. Maximal degree in co-relation 109252. Up to 7915 conditions per place. [2023-08-29 20:14:27,016 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 110 selfloop transitions, 20 changer transitions 92/245 dead transitions. [2023-08-29 20:14:27,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 245 transitions, 2566 flow [2023-08-29 20:14:27,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 20:14:27,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 20:14:27,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1483 transitions. [2023-08-29 20:14:27,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49565508021390375 [2023-08-29 20:14:27,019 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1483 transitions. [2023-08-29 20:14:27,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1483 transitions. [2023-08-29 20:14:27,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:14:27,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1483 transitions. [2023-08-29 20:14:27,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 134.8181818181818) internal successors, (1483), 11 states have internal predecessors, (1483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:27,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 272.0) internal successors, (3264), 12 states have internal predecessors, (3264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:27,025 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 272.0) internal successors, (3264), 12 states have internal predecessors, (3264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:27,026 INFO L175 Difference]: Start difference. First operand has 103 places, 99 transitions, 949 flow. Second operand 11 states and 1483 transitions. [2023-08-29 20:14:27,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 245 transitions, 2566 flow [2023-08-29 20:14:29,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 245 transitions, 2351 flow, removed 75 selfloop flow, removed 6 redundant places. [2023-08-29 20:14:29,045 INFO L231 Difference]: Finished difference. Result has 110 places, 80 transitions, 694 flow [2023-08-29 20:14:29,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=694, PETRI_PLACES=110, PETRI_TRANSITIONS=80} [2023-08-29 20:14:29,046 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 56 predicate places. [2023-08-29 20:14:29,046 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 80 transitions, 694 flow [2023-08-29 20:14:29,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 127.0) internal successors, (889), 7 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:29,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:14:29,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:14:29,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 20:14:29,047 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:14:29,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:14:29,047 INFO L85 PathProgramCache]: Analyzing trace with hash -2141738407, now seen corresponding path program 1 times [2023-08-29 20:14:29,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:14:29,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851718877] [2023-08-29 20:14:29,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:14:29,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:14:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:14:29,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:14:29,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:14:29,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851718877] [2023-08-29 20:14:29,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851718877] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:14:29,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:14:29,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:14:29,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463784313] [2023-08-29 20:14:29,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:14:29,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:14:29,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:14:29,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:14:29,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:14:29,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 272 [2023-08-29 20:14:29,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 80 transitions, 694 flow. Second operand has 6 states, 6 states have (on average 117.83333333333333) internal successors, (707), 6 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:29,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:14:29,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 272 [2023-08-29 20:14:29,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:14:33,280 INFO L130 PetriNetUnfolder]: 23197/34642 cut-off events. [2023-08-29 20:14:33,280 INFO L131 PetriNetUnfolder]: For 189558/192154 co-relation queries the response was YES. [2023-08-29 20:14:33,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178847 conditions, 34642 events. 23197/34642 cut-off events. For 189558/192154 co-relation queries the response was YES. Maximal size of possible extension queue 1865. Compared 249093 event pairs, 5396 based on Foata normal form. 1480/36093 useless extension candidates. Maximal degree in co-relation 178812. Up to 19219 conditions per place. [2023-08-29 20:14:33,564 INFO L137 encePairwiseOnDemand]: 263/272 looper letters, 66 selfloop transitions, 3 changer transitions 117/188 dead transitions. [2023-08-29 20:14:33,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 188 transitions, 1899 flow [2023-08-29 20:14:33,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:14:33,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:14:33,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 882 transitions. [2023-08-29 20:14:33,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4632352941176471 [2023-08-29 20:14:33,566 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 882 transitions. [2023-08-29 20:14:33,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 882 transitions. [2023-08-29 20:14:33,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:14:33,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 882 transitions. [2023-08-29 20:14:33,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:33,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:33,569 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:33,569 INFO L175 Difference]: Start difference. First operand has 110 places, 80 transitions, 694 flow. Second operand 7 states and 882 transitions. [2023-08-29 20:14:33,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 188 transitions, 1899 flow [2023-08-29 20:14:35,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 188 transitions, 1621 flow, removed 88 selfloop flow, removed 14 redundant places. [2023-08-29 20:14:35,331 INFO L231 Difference]: Finished difference. Result has 101 places, 52 transitions, 328 flow [2023-08-29 20:14:35,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=328, PETRI_PLACES=101, PETRI_TRANSITIONS=52} [2023-08-29 20:14:35,331 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 47 predicate places. [2023-08-29 20:14:35,331 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 52 transitions, 328 flow [2023-08-29 20:14:35,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.83333333333333) internal successors, (707), 6 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:35,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:14:35,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:14:35,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 20:14:35,332 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:14:35,333 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:14:35,333 INFO L85 PathProgramCache]: Analyzing trace with hash -206019223, now seen corresponding path program 2 times [2023-08-29 20:14:35,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:14:35,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246242709] [2023-08-29 20:14:35,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:14:35,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:14:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:14:36,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:14:36,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:14:36,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246242709] [2023-08-29 20:14:36,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246242709] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:14:36,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:14:36,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:14:36,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855935263] [2023-08-29 20:14:36,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:14:36,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:14:36,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:14:36,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:14:36,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:14:36,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 272 [2023-08-29 20:14:36,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 52 transitions, 328 flow. Second operand has 8 states, 8 states have (on average 118.75) internal successors, (950), 8 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:36,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:14:36,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 272 [2023-08-29 20:14:36,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:14:36,822 INFO L130 PetriNetUnfolder]: 3216/5025 cut-off events. [2023-08-29 20:14:36,822 INFO L131 PetriNetUnfolder]: For 13098/13098 co-relation queries the response was YES. [2023-08-29 20:14:36,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21138 conditions, 5025 events. 3216/5025 cut-off events. For 13098/13098 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 27570 event pairs, 808 based on Foata normal form. 2/5027 useless extension candidates. Maximal degree in co-relation 21109. Up to 3272 conditions per place. [2023-08-29 20:14:36,845 INFO L137 encePairwiseOnDemand]: 263/272 looper letters, 64 selfloop transitions, 11 changer transitions 22/97 dead transitions. [2023-08-29 20:14:36,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 97 transitions, 779 flow [2023-08-29 20:14:36,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:14:36,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:14:36,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 868 transitions. [2023-08-29 20:14:36,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45588235294117646 [2023-08-29 20:14:36,846 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 868 transitions. [2023-08-29 20:14:36,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 868 transitions. [2023-08-29 20:14:36,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:14:36,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 868 transitions. [2023-08-29 20:14:36,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:36,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:36,849 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:36,849 INFO L175 Difference]: Start difference. First operand has 101 places, 52 transitions, 328 flow. Second operand 7 states and 868 transitions. [2023-08-29 20:14:36,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 97 transitions, 779 flow [2023-08-29 20:14:36,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 97 transitions, 715 flow, removed 26 selfloop flow, removed 15 redundant places. [2023-08-29 20:14:36,909 INFO L231 Difference]: Finished difference. Result has 78 places, 55 transitions, 348 flow [2023-08-29 20:14:36,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=348, PETRI_PLACES=78, PETRI_TRANSITIONS=55} [2023-08-29 20:14:36,909 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 24 predicate places. [2023-08-29 20:14:36,909 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 55 transitions, 348 flow [2023-08-29 20:14:36,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 118.75) internal successors, (950), 8 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:36,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:14:36,910 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:14:36,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 20:14:36,910 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:14:36,911 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:14:36,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1577237771, now seen corresponding path program 3 times [2023-08-29 20:14:36,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:14:36,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372773158] [2023-08-29 20:14:36,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:14:36,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:14:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:14:37,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:14:38,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:14:38,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372773158] [2023-08-29 20:14:38,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372773158] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:14:38,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:14:38,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-29 20:14:38,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775189076] [2023-08-29 20:14:38,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:14:38,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-29 20:14:38,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:14:38,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-29 20:14:38,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-08-29 20:14:38,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 272 [2023-08-29 20:14:38,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 55 transitions, 348 flow. Second operand has 11 states, 11 states have (on average 125.27272727272727) internal successors, (1378), 11 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:38,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:14:38,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 272 [2023-08-29 20:14:38,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:14:38,609 INFO L130 PetriNetUnfolder]: 2433/3954 cut-off events. [2023-08-29 20:14:38,610 INFO L131 PetriNetUnfolder]: For 11388/11568 co-relation queries the response was YES. [2023-08-29 20:14:38,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17015 conditions, 3954 events. 2433/3954 cut-off events. For 11388/11568 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 22591 event pairs, 394 based on Foata normal form. 28/3898 useless extension candidates. Maximal degree in co-relation 16993. Up to 1898 conditions per place. [2023-08-29 20:14:38,625 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 80 selfloop transitions, 10 changer transitions 18/114 dead transitions. [2023-08-29 20:14:38,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 114 transitions, 901 flow [2023-08-29 20:14:38,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:14:38,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:14:38,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 922 transitions. [2023-08-29 20:14:38,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4842436974789916 [2023-08-29 20:14:38,627 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 922 transitions. [2023-08-29 20:14:38,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 922 transitions. [2023-08-29 20:14:38,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:14:38,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 922 transitions. [2023-08-29 20:14:38,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.71428571428572) internal successors, (922), 7 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:38,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:38,629 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:38,629 INFO L175 Difference]: Start difference. First operand has 78 places, 55 transitions, 348 flow. Second operand 7 states and 922 transitions. [2023-08-29 20:14:38,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 114 transitions, 901 flow [2023-08-29 20:14:38,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 114 transitions, 865 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-08-29 20:14:38,685 INFO L231 Difference]: Finished difference. Result has 81 places, 59 transitions, 403 flow [2023-08-29 20:14:38,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=403, PETRI_PLACES=81, PETRI_TRANSITIONS=59} [2023-08-29 20:14:38,686 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 27 predicate places. [2023-08-29 20:14:38,686 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 59 transitions, 403 flow [2023-08-29 20:14:38,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 125.27272727272727) internal successors, (1378), 11 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:38,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:14:38,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:14:38,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 20:14:38,687 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:14:38,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:14:38,687 INFO L85 PathProgramCache]: Analyzing trace with hash 509469427, now seen corresponding path program 4 times [2023-08-29 20:14:38,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:14:38,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795780788] [2023-08-29 20:14:38,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:14:38,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:14:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:14:40,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:14:40,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:14:40,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795780788] [2023-08-29 20:14:40,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795780788] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:14:40,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:14:40,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-29 20:14:40,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683660820] [2023-08-29 20:14:40,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:14:40,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-29 20:14:40,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:14:40,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-29 20:14:40,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-29 20:14:40,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 272 [2023-08-29 20:14:40,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 59 transitions, 403 flow. Second operand has 11 states, 11 states have (on average 111.72727272727273) internal successors, (1229), 11 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:40,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:14:40,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 272 [2023-08-29 20:14:40,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:14:41,227 INFO L130 PetriNetUnfolder]: 3681/5825 cut-off events. [2023-08-29 20:14:41,227 INFO L131 PetriNetUnfolder]: For 20291/20291 co-relation queries the response was YES. [2023-08-29 20:14:41,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25585 conditions, 5825 events. 3681/5825 cut-off events. For 20291/20291 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 33468 event pairs, 421 based on Foata normal form. 2/5827 useless extension candidates. Maximal degree in co-relation 25561. Up to 2316 conditions per place. [2023-08-29 20:14:41,252 INFO L137 encePairwiseOnDemand]: 259/272 looper letters, 60 selfloop transitions, 8 changer transitions 92/160 dead transitions. [2023-08-29 20:14:41,252 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 160 transitions, 1316 flow [2023-08-29 20:14:41,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:14:41,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:14:41,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1082 transitions. [2023-08-29 20:14:41,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44199346405228757 [2023-08-29 20:14:41,255 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1082 transitions. [2023-08-29 20:14:41,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1082 transitions. [2023-08-29 20:14:41,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:14:41,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1082 transitions. [2023-08-29 20:14:41,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.22222222222223) internal successors, (1082), 9 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:41,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 272.0) internal successors, (2720), 10 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:41,259 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 272.0) internal successors, (2720), 10 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:41,259 INFO L175 Difference]: Start difference. First operand has 81 places, 59 transitions, 403 flow. Second operand 9 states and 1082 transitions. [2023-08-29 20:14:41,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 160 transitions, 1316 flow [2023-08-29 20:14:41,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 160 transitions, 1298 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-29 20:14:41,393 INFO L231 Difference]: Finished difference. Result has 89 places, 54 transitions, 376 flow [2023-08-29 20:14:41,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=376, PETRI_PLACES=89, PETRI_TRANSITIONS=54} [2023-08-29 20:14:41,393 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 35 predicate places. [2023-08-29 20:14:41,393 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 54 transitions, 376 flow [2023-08-29 20:14:41,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 111.72727272727273) internal successors, (1229), 11 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:41,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:14:41,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:14:41,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-29 20:14:41,394 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:14:41,395 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:14:41,395 INFO L85 PathProgramCache]: Analyzing trace with hash 705429381, now seen corresponding path program 5 times [2023-08-29 20:14:41,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:14:41,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926003970] [2023-08-29 20:14:41,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:14:41,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:14:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:14:41,441 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:14:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:14:41,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:14:41,544 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:14:41,545 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-29 20:14:41,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-29 20:14:41,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-29 20:14:41,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-29 20:14:41,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-29 20:14:41,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-29 20:14:41,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-29 20:14:41,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-29 20:14:41,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-29 20:14:41,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-29 20:14:41,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-29 20:14:41,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-29 20:14:41,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-29 20:14:41,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-29 20:14:41,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-29 20:14:41,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-29 20:14:41,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-29 20:14:41,560 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:14:41,566 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:14:41,567 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:14:41,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:14:41 BasicIcfg [2023-08-29 20:14:41,643 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:14:41,643 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:14:41,643 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:14:41,643 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:14:41,644 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:13:27" (3/4) ... [2023-08-29 20:14:41,646 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:14:41,646 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:14:41,647 INFO L158 Benchmark]: Toolchain (without parser) took 75751.47ms. Allocated memory was 65.0MB in the beginning and 11.8GB in the end (delta: 11.8GB). Free memory was 40.9MB in the beginning and 9.3GB in the end (delta: -9.2GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2023-08-29 20:14:41,647 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 65.0MB. Free memory was 42.3MB in the beginning and 42.3MB in the end (delta: 53.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:14:41,647 INFO L158 Benchmark]: CACSL2BoogieTranslator took 618.40ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 40.8MB in the beginning and 48.8MB in the end (delta: -8.0MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2023-08-29 20:14:41,647 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.72ms. Allocated memory is still 81.8MB. Free memory was 48.8MB in the beginning and 45.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:14:41,648 INFO L158 Benchmark]: Boogie Preprocessor took 57.33ms. Allocated memory is still 81.8MB. Free memory was 45.9MB in the beginning and 43.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:14:41,648 INFO L158 Benchmark]: RCFGBuilder took 783.13ms. Allocated memory is still 81.8MB. Free memory was 43.9MB in the beginning and 27.3MB in the end (delta: 16.6MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2023-08-29 20:14:41,648 INFO L158 Benchmark]: TraceAbstraction took 74208.55ms. Allocated memory was 81.8MB in the beginning and 11.8GB in the end (delta: 11.8GB). Free memory was 26.7MB in the beginning and 9.3GB in the end (delta: -9.2GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2023-08-29 20:14:41,649 INFO L158 Benchmark]: Witness Printer took 3.04ms. Allocated memory is still 11.8GB. Free memory was 9.3GB in the beginning and 9.3GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:14:41,650 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.21ms. Allocated memory is still 65.0MB. Free memory was 42.3MB in the beginning and 42.3MB in the end (delta: 53.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 618.40ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 40.8MB in the beginning and 48.8MB in the end (delta: -8.0MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.72ms. Allocated memory is still 81.8MB. Free memory was 48.8MB in the beginning and 45.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.33ms. Allocated memory is still 81.8MB. Free memory was 45.9MB in the beginning and 43.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 783.13ms. Allocated memory is still 81.8MB. Free memory was 43.9MB in the beginning and 27.3MB in the end (delta: 16.6MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * TraceAbstraction took 74208.55ms. Allocated memory was 81.8MB in the beginning and 11.8GB in the end (delta: 11.8GB). Free memory was 26.7MB in the beginning and 9.3GB in the end (delta: -9.2GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. * Witness Printer took 3.04ms. Allocated memory is still 11.8GB. Free memory was 9.3GB in the beginning and 9.3GB in the end (delta: 1.0MB). 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: 5.2s, 152 PlacesBefore, 54 PlacesAfterwards, 141 TransitionsBefore, 42 TransitionsAfterwards, 3638 CoEnabledTransitionPairs, 8 FixpointIterations, 47 TrivialSequentialCompositions, 72 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 127 TotalNumberOfCompositions, 12096 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6131, independent: 5837, independent conditional: 0, independent unconditional: 5837, dependent: 294, dependent conditional: 0, dependent unconditional: 294, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1885, independent: 1846, independent conditional: 0, independent unconditional: 1846, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6131, independent: 3991, independent conditional: 0, independent unconditional: 3991, dependent: 255, dependent conditional: 0, dependent unconditional: 255, unknown: 1885, unknown conditional: 0, unknown unconditional: 1885] , Statistics on independence cache: Total cache size (in pairs): 238, Positive cache size: 219, Positive conditional cache size: 0, Positive unconditional cache size: 219, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t145; [L859] FCALL, FORK 0 pthread_create(&t145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t145, ((void *)0), P0, ((void *)0))=-4, t145={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L860] 0 pthread_t t146; [L861] FCALL, FORK 0 pthread_create(&t146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t146, ((void *)0), P1, ((void *)0))=-3, t145={5:0}, t146={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L862] 0 pthread_t t147; [L863] FCALL, FORK 0 pthread_create(&t147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t147, ((void *)0), P2, ((void *)0))=-2, t145={5:0}, t146={6:0}, t147={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L864] 0 pthread_t t148; [L865] FCALL, FORK 0 pthread_create(&t148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t148, ((void *)0), P3, ((void *)0))=-1, t145={5:0}, t146={6:0}, t147={7:0}, t148={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L760] 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) [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] 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 [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] 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=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L790] 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) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 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 [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 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=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L813] 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) [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] 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 [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] 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=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 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) [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] 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 [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t145={5:0}, t146={6:0}, t147={7:0}, t148={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L883] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L884] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L885] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L886] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L888] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 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: 856]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 859]: 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: 865]: 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: 861]: 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: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 183 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 74.0s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 57.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2011 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1627 mSDsluCounter, 1304 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1123 mSDsCounter, 340 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4841 IncrementalHoareTripleChecker+Invalid, 5181 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 340 mSolverCounterUnsat, 181 mSDtfsCounter, 4841 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=949occurred in iteration=16, InterpolantAutomatonStates: 136, 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.6s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 427 NumberOfCodeBlocks, 427 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 376 ConstructedInterpolants, 0 QuantifiedInterpolants, 5201 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 20:14:41,676 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/mix005_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c22ca6d642b28badc1dc02a5cc527ddbb1f35b5d6d2e3ba3e8f314e81f0fd465 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:14:44,260 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:14:44,263 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:14:44,299 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:14:44,299 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:14:44,300 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:14:44,301 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:14:44,303 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:14:44,304 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:14:44,305 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:14:44,306 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:14:44,307 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:14:44,308 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:14:44,309 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:14:44,310 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:14:44,311 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:14:44,312 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:14:44,313 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:14:44,316 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:14:44,323 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:14:44,327 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:14:44,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:14:44,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:14:44,336 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:14:44,339 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:14:44,344 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:14:44,344 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:14:44,345 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:14:44,345 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:14:44,347 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:14:44,347 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:14:44,348 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:14:44,352 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:14:44,352 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:14:44,354 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:14:44,354 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:14:44,355 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:14:44,356 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:14:44,356 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:14:44,357 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:14:44,357 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:14:44,358 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-29 20:14:44,378 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:14:44,379 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:14:44,379 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:14:44,379 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:14:44,380 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:14:44,380 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:14:44,380 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:14:44,381 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:14:44,381 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:14:44,381 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:14:44,381 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:14:44,381 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:14:44,381 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:14:44,382 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:14:44,382 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:14:44,382 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:14:44,382 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:14:44,382 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:14:44,382 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:14:44,382 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:14:44,383 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:14:44,383 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:14:44,383 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:14:44,383 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:14:44,383 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:14:44,383 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:14:44,384 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:14:44,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:14:44,384 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:14:44,384 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:14:44,384 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:14:44,384 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:14:44,384 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:14:44,385 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:14:44,385 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:14:44,385 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:14:44,385 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:14:44,385 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 -> c22ca6d642b28badc1dc02a5cc527ddbb1f35b5d6d2e3ba3e8f314e81f0fd465 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 20:14:44,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:14:44,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:14:44,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:14:44,731 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:14:44,732 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:14:44,733 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2023-08-29 20:14:45,834 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:14:46,140 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:14:46,140 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2023-08-29 20:14:46,161 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b4503680/6a7e03def4b240c687046c5641fc0fa9/FLAGadc91ce9d [2023-08-29 20:14:46,172 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b4503680/6a7e03def4b240c687046c5641fc0fa9 [2023-08-29 20:14:46,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:14:46,175 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:14:46,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:14:46,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:14:46,181 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:14:46,182 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:14:46" (1/1) ... [2023-08-29 20:14:46,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1df092fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:14:46, skipping insertion in model container [2023-08-29 20:14:46,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:14:46" (1/1) ... [2023-08-29 20:14:46,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:14:46,248 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:14:46,368 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/mix005_tso.oepc.i[949,962] [2023-08-29 20:14:46,604 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:14:46,619 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:14:46,631 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/mix005_tso.oepc.i[949,962] [2023-08-29 20:14:46,694 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:14:46,733 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:14:46,733 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:14:46,740 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:14:46,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:14:46 WrapperNode [2023-08-29 20:14:46,740 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:14:46,742 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:14:46,742 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:14:46,742 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:14:46,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:14:46" (1/1) ... [2023-08-29 20:14:46,792 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:14:46" (1/1) ... [2023-08-29 20:14:46,813 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2023-08-29 20:14:46,814 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:14:46,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:14:46,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:14:46,815 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:14:46,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:14:46" (1/1) ... [2023-08-29 20:14:46,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:14:46" (1/1) ... [2023-08-29 20:14:46,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:14:46" (1/1) ... [2023-08-29 20:14:46,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:14:46" (1/1) ... [2023-08-29 20:14:46,845 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:14:46" (1/1) ... [2023-08-29 20:14:46,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:14:46" (1/1) ... [2023-08-29 20:14:46,855 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:14:46" (1/1) ... [2023-08-29 20:14:46,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:14:46" (1/1) ... [2023-08-29 20:14:46,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:14:46,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:14:46,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:14:46,870 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:14:46,873 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:14:46" (1/1) ... [2023-08-29 20:14:46,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:14:46,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:14:46,901 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 20:14:46,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 20:14:46,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:14:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:14:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:14:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:14:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:14:46,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:14:46,940 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:14:46,940 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:14:46,940 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:14:46,941 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:14:46,941 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:14:46,941 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:14:46,941 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-29 20:14:46,941 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-29 20:14:46,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:14:46,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:14:46,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:14:46,943 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:14:47,131 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:14:47,133 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:14:47,445 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:14:47,612 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:14:47,612 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:14:47,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:14:47 BoogieIcfgContainer [2023-08-29 20:14:47,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:14:47,618 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:14:47,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:14:47,621 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:14:47,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:14:46" (1/3) ... [2023-08-29 20:14:47,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e16c2bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:14:47, skipping insertion in model container [2023-08-29 20:14:47,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:14:46" (2/3) ... [2023-08-29 20:14:47,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e16c2bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:14:47, skipping insertion in model container [2023-08-29 20:14:47,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:14:47" (3/3) ... [2023-08-29 20:14:47,624 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005_tso.oepc.i [2023-08-29 20:14:47,639 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:14:47,640 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-29 20:14:47,640 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:14:47,700 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:14:47,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 146 transitions, 312 flow [2023-08-29 20:14:47,822 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2023-08-29 20:14:47,822 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:14:47,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 108 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-29 20:14:47,829 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 146 transitions, 312 flow [2023-08-29 20:14:47,836 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 142 transitions, 296 flow [2023-08-29 20:14:47,841 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:14:47,861 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 142 transitions, 296 flow [2023-08-29 20:14:47,865 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 142 transitions, 296 flow [2023-08-29 20:14:47,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 296 flow [2023-08-29 20:14:47,916 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2023-08-29 20:14:47,917 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:14:47,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 108 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-29 20:14:47,922 INFO L119 LiptonReduction]: Number of co-enabled transitions 3638 [2023-08-29 20:14:55,677 INFO L134 LiptonReduction]: Checked pairs total: 11021 [2023-08-29 20:14:55,677 INFO L136 LiptonReduction]: Total number of compositions: 136 [2023-08-29 20:14:55,694 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:14:55,701 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;@5ae21189, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:14:55,702 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-29 20:14:55,703 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:14:55,703 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:14:55,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:14:55,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:14:55,705 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:14:55,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:14:55,709 INFO L85 PathProgramCache]: Analyzing trace with hash 614, now seen corresponding path program 1 times [2023-08-29 20:14:55,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:14:55,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [699452362] [2023-08-29 20:14:55,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:14:55,723 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:14:55,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:14:55,729 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:14:55,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-29 20:14:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:14:55,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:14:55,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:14:55,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:14:55,812 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:14:55,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:14:55,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [699452362] [2023-08-29 20:14:55,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [699452362] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:14:55,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:14:55,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:14:55,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544810237] [2023-08-29 20:14:55,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:14:55,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:14:55,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:14:55,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:14:55,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:14:55,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 282 [2023-08-29 20:14:55,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:55,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:14:55,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 282 [2023-08-29 20:14:55,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:14:57,130 INFO L130 PetriNetUnfolder]: 5973/8262 cut-off events. [2023-08-29 20:14:57,130 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-08-29 20:14:57,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16580 conditions, 8262 events. 5973/8262 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 44198 event pairs, 5973 based on Foata normal form. 0/6994 useless extension candidates. Maximal degree in co-relation 16568. Up to 8103 conditions per place. [2023-08-29 20:14:57,194 INFO L137 encePairwiseOnDemand]: 274/282 looper letters, 26 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-08-29 20:14:57,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 128 flow [2023-08-29 20:14:57,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:14:57,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:14:57,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 296 transitions. [2023-08-29 20:14:57,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.524822695035461 [2023-08-29 20:14:57,207 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 296 transitions. [2023-08-29 20:14:57,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 296 transitions. [2023-08-29 20:14:57,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:14:57,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 296 transitions. [2023-08-29 20:14:57,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 148.0) internal successors, (296), 2 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:57,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:57,217 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:57,219 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 92 flow. Second operand 2 states and 296 transitions. [2023-08-29 20:14:57,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 128 flow [2023-08-29 20:14:57,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:14:57,233 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-08-29 20:14:57,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-08-29 20:14:57,239 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-08-29 20:14:57,239 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-08-29 20:14:57,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:57,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:14:57,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 20:14:57,251 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-29 20:14:57,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:14:57,449 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:14:57,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:14:57,449 INFO L85 PathProgramCache]: Analyzing trace with hash 582743487, now seen corresponding path program 1 times [2023-08-29 20:14:57,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:14:57,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998618943] [2023-08-29 20:14:57,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:14:57,451 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:14:57,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:14:57,452 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:14:57,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-29 20:14:57,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:14:57,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:14:57,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:14:57,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:14:57,553 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:14:57,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:14:57,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998618943] [2023-08-29 20:14:57,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1998618943] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:14:57,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:14:57,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:14:57,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070118688] [2023-08-29 20:14:57,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:14:57,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:14:57,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:14:57,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:14:57,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:14:57,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 282 [2023-08-29 20:14:57,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:57,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:14:57,560 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 282 [2023-08-29 20:14:57,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:14:58,485 INFO L130 PetriNetUnfolder]: 4695/6858 cut-off events. [2023-08-29 20:14:58,485 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:14:58,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13431 conditions, 6858 events. 4695/6858 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 41212 event pairs, 861 based on Foata normal form. 0/6285 useless extension candidates. Maximal degree in co-relation 13428. Up to 5107 conditions per place. [2023-08-29 20:14:58,521 INFO L137 encePairwiseOnDemand]: 279/282 looper letters, 39 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2023-08-29 20:14:58,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 49 transitions, 196 flow [2023-08-29 20:14:58,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:14:58,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:14:58,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2023-08-29 20:14:58,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5130023640661938 [2023-08-29 20:14:58,525 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2023-08-29 20:14:58,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2023-08-29 20:14:58,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:14:58,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2023-08-29 20:14:58,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:58,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:58,531 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:58,531 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 434 transitions. [2023-08-29 20:14:58,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 49 transitions, 196 flow [2023-08-29 20:14:58,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 49 transitions, 196 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:14:58,533 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2023-08-29 20:14:58,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-08-29 20:14:58,534 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-08-29 20:14:58,534 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2023-08-29 20:14:58,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:58,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:14:58,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:14:58,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-29 20:14:58,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:14:58,744 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:14:58,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:14:58,745 INFO L85 PathProgramCache]: Analyzing trace with hash -746407119, now seen corresponding path program 1 times [2023-08-29 20:14:58,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:14:58,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1292317254] [2023-08-29 20:14:58,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:14:58,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-29 20:14:58,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:14:58,749 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:14:58,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-29 20:14:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:14:58,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:14:58,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:14:58,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:14:58,887 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:14:58,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:14:58,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1292317254] [2023-08-29 20:14:58,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1292317254] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:14:58,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:14:58,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:14:58,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760317218] [2023-08-29 20:14:58,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:14:58,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:14:58,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:14:58,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:14:58,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:14:58,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 282 [2023-08-29 20:14:58,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:58,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:14:58,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 282 [2023-08-29 20:14:58,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:14:59,553 INFO L130 PetriNetUnfolder]: 3224/4682 cut-off events. [2023-08-29 20:14:59,554 INFO L131 PetriNetUnfolder]: For 313/313 co-relation queries the response was YES. [2023-08-29 20:14:59,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9778 conditions, 4682 events. 3224/4682 cut-off events. For 313/313 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 25458 event pairs, 626 based on Foata normal form. 256/4690 useless extension candidates. Maximal degree in co-relation 9774. Up to 3325 conditions per place. [2023-08-29 20:14:59,576 INFO L137 encePairwiseOnDemand]: 275/282 looper letters, 37 selfloop transitions, 5 changer transitions 25/73 dead transitions. [2023-08-29 20:14:59,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 73 transitions, 304 flow [2023-08-29 20:14:59,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:14:59,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:14:59,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 679 transitions. [2023-08-29 20:14:59,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48156028368794324 [2023-08-29 20:14:59,579 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 679 transitions. [2023-08-29 20:14:59,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 679 transitions. [2023-08-29 20:14:59,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:14:59,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 679 transitions. [2023-08-29 20:14:59,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:59,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 282.0) internal successors, (1692), 6 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:59,586 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 282.0) internal successors, (1692), 6 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:59,586 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 5 states and 679 transitions. [2023-08-29 20:14:59,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 73 transitions, 304 flow [2023-08-29 20:14:59,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 73 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:14:59,588 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 113 flow [2023-08-29 20:14:59,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2023-08-29 20:14:59,589 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2023-08-29 20:14:59,589 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 113 flow [2023-08-29 20:14:59,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:59,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:14:59,590 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:14:59,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-29 20:14:59,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:14:59,800 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:14:59,801 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:14:59,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1659023804, now seen corresponding path program 1 times [2023-08-29 20:14:59,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:14:59,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1538276678] [2023-08-29 20:14:59,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:14:59,802 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:14:59,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:14:59,803 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:14:59,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-29 20:14:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:14:59,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:14:59,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:14:59,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-29 20:14:59,970 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:14:59,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:14:59,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1538276678] [2023-08-29 20:14:59,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1538276678] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:14:59,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:14:59,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:14:59,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433879966] [2023-08-29 20:14:59,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:14:59,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:14:59,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:14:59,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:14:59,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:14:59,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 282 [2023-08-29 20:14:59,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:14:59,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:14:59,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 282 [2023-08-29 20:14:59,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:15:00,513 INFO L130 PetriNetUnfolder]: 1712/2660 cut-off events. [2023-08-29 20:15:00,515 INFO L131 PetriNetUnfolder]: For 924/924 co-relation queries the response was YES. [2023-08-29 20:15:00,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7083 conditions, 2660 events. 1712/2660 cut-off events. For 924/924 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 14210 event pairs, 330 based on Foata normal form. 175/2726 useless extension candidates. Maximal degree in co-relation 7076. Up to 1057 conditions per place. [2023-08-29 20:15:00,529 INFO L137 encePairwiseOnDemand]: 275/282 looper letters, 49 selfloop transitions, 9 changer transitions 25/89 dead transitions. [2023-08-29 20:15:00,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 89 transitions, 449 flow [2023-08-29 20:15:00,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:15:00,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:15:00,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 817 transitions. [2023-08-29 20:15:00,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48286052009456265 [2023-08-29 20:15:00,532 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 817 transitions. [2023-08-29 20:15:00,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 817 transitions. [2023-08-29 20:15:00,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:15:00,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 817 transitions. [2023-08-29 20:15:00,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.16666666666666) internal successors, (817), 6 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:00,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 282.0) internal successors, (1974), 7 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:00,539 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 282.0) internal successors, (1974), 7 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:00,539 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 113 flow. Second operand 6 states and 817 transitions. [2023-08-29 20:15:00,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 89 transitions, 449 flow [2023-08-29 20:15:00,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 89 transitions, 442 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:15:00,549 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 178 flow [2023-08-29 20:15:00,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2023-08-29 20:15:00,550 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2023-08-29 20:15:00,550 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 178 flow [2023-08-29 20:15:00,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:00,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:15:00,551 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-29 20:15:00,563 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 (5)] Forceful destruction successful, exit code 0 [2023-08-29 20:15:00,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:15:00,761 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:15:00,761 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:15:00,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1701143744, now seen corresponding path program 1 times [2023-08-29 20:15:00,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:15:00,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146180488] [2023-08-29 20:15:00,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:15:00,763 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:15:00,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:15:00,764 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:15:00,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-29 20:15:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:15:00,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:15:00,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:15:00,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:15:00,945 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:15:00,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:15:00,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146180488] [2023-08-29 20:15:00,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146180488] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:15:00,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:15:00,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:15:00,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096951896] [2023-08-29 20:15:00,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:15:00,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:15:00,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:15:00,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:15:00,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:15:00,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 282 [2023-08-29 20:15:00,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:00,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:15:00,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 282 [2023-08-29 20:15:00,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:15:01,370 INFO L130 PetriNetUnfolder]: 1010/1634 cut-off events. [2023-08-29 20:15:01,370 INFO L131 PetriNetUnfolder]: For 1538/1538 co-relation queries the response was YES. [2023-08-29 20:15:01,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4894 conditions, 1634 events. 1010/1634 cut-off events. For 1538/1538 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 8201 event pairs, 276 based on Foata normal form. 67/1649 useless extension candidates. Maximal degree in co-relation 4885. Up to 540 conditions per place. [2023-08-29 20:15:01,379 INFO L137 encePairwiseOnDemand]: 275/282 looper letters, 59 selfloop transitions, 13 changer transitions 25/103 dead transitions. [2023-08-29 20:15:01,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 103 transitions, 614 flow [2023-08-29 20:15:01,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:15:01,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:15:01,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 953 transitions. [2023-08-29 20:15:01,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4827760891590679 [2023-08-29 20:15:01,383 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 953 transitions. [2023-08-29 20:15:01,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 953 transitions. [2023-08-29 20:15:01,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:15:01,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 953 transitions. [2023-08-29 20:15:01,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.14285714285714) internal successors, (953), 7 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:01,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 282.0) internal successors, (2256), 8 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:01,391 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 282.0) internal successors, (2256), 8 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:01,391 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 178 flow. Second operand 7 states and 953 transitions. [2023-08-29 20:15:01,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 103 transitions, 614 flow [2023-08-29 20:15:01,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 103 transitions, 552 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-29 20:15:01,403 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 228 flow [2023-08-29 20:15:01,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=228, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2023-08-29 20:15:01,404 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2023-08-29 20:15:01,404 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 228 flow [2023-08-29 20:15:01,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:01,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:15:01,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:15:01,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-29 20:15:01,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:15:01,620 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:15:01,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:15:01,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1401259185, now seen corresponding path program 1 times [2023-08-29 20:15:01,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:15:01,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505971178] [2023-08-29 20:15:01,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:15:01,622 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:15:01,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:15:01,623 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:15:01,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-29 20:15:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:15:01,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-29 20:15:01,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:15:01,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:15:01,830 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:15:01,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:15:01,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505971178] [2023-08-29 20:15:01,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [505971178] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:15:01,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:15:01,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:15:01,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225104749] [2023-08-29 20:15:01,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:15:01,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:15:01,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:15:01,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:15:01,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:15:01,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 282 [2023-08-29 20:15:01,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 228 flow. Second operand has 7 states, 7 states have (on average 124.85714285714286) internal successors, (874), 7 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:01,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:15:01,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 282 [2023-08-29 20:15:01,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:15:02,312 INFO L130 PetriNetUnfolder]: 866/1388 cut-off events. [2023-08-29 20:15:02,313 INFO L131 PetriNetUnfolder]: For 1254/1254 co-relation queries the response was YES. [2023-08-29 20:15:02,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3994 conditions, 1388 events. 866/1388 cut-off events. For 1254/1254 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6804 event pairs, 272 based on Foata normal form. 13/1361 useless extension candidates. Maximal degree in co-relation 3984. Up to 540 conditions per place. [2023-08-29 20:15:02,323 INFO L137 encePairwiseOnDemand]: 275/282 looper letters, 55 selfloop transitions, 17 changer transitions 13/91 dead transitions. [2023-08-29 20:15:02,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 91 transitions, 554 flow [2023-08-29 20:15:02,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:15:02,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:15:02,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1063 transitions. [2023-08-29 20:15:02,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47118794326241137 [2023-08-29 20:15:02,327 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1063 transitions. [2023-08-29 20:15:02,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1063 transitions. [2023-08-29 20:15:02,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:15:02,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1063 transitions. [2023-08-29 20:15:02,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 132.875) internal successors, (1063), 8 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:02,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 282.0) internal successors, (2538), 9 states have internal predecessors, (2538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:02,334 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 282.0) internal successors, (2538), 9 states have internal predecessors, (2538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:02,334 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 228 flow. Second operand 8 states and 1063 transitions. [2023-08-29 20:15:02,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 91 transitions, 554 flow [2023-08-29 20:15:02,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 91 transitions, 492 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-29 20:15:02,347 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 222 flow [2023-08-29 20:15:02,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=222, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2023-08-29 20:15:02,350 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 4 predicate places. [2023-08-29 20:15:02,350 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 222 flow [2023-08-29 20:15:02,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 124.85714285714286) internal successors, (874), 7 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:02,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:15:02,351 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:15:02,367 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-29 20:15:02,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:15:02,561 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:15:02,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:15:02,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1505831346, now seen corresponding path program 1 times [2023-08-29 20:15:02,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:15:02,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [231443187] [2023-08-29 20:15:02,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:15:02,562 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:15:02,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:15:02,563 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:15:02,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-29 20:15:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:15:02,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-29 20:15:02,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:15:03,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:15:03,310 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:15:03,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:15:03,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [231443187] [2023-08-29 20:15:03,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [231443187] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:15:03,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:15:03,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:15:03,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874663680] [2023-08-29 20:15:03,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:15:03,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:15:03,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:15:03,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:15:03,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:15:03,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 282 [2023-08-29 20:15:03,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 114.83333333333333) internal successors, (689), 6 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:03,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:15:03,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 282 [2023-08-29 20:15:03,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:15:04,129 INFO L130 PetriNetUnfolder]: 855/1446 cut-off events. [2023-08-29 20:15:04,129 INFO L131 PetriNetUnfolder]: For 1694/1694 co-relation queries the response was YES. [2023-08-29 20:15:04,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3999 conditions, 1446 events. 855/1446 cut-off events. For 1694/1694 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7708 event pairs, 7 based on Foata normal form. 0/1430 useless extension candidates. Maximal degree in co-relation 3988. Up to 1043 conditions per place. [2023-08-29 20:15:04,138 INFO L137 encePairwiseOnDemand]: 277/282 looper letters, 57 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2023-08-29 20:15:04,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 67 transitions, 475 flow [2023-08-29 20:15:04,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:15:04,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:15:04,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 708 transitions. [2023-08-29 20:15:04,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41843971631205673 [2023-08-29 20:15:04,142 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 708 transitions. [2023-08-29 20:15:04,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 708 transitions. [2023-08-29 20:15:04,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:15:04,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 708 transitions. [2023-08-29 20:15:04,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:04,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 282.0) internal successors, (1974), 7 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:04,147 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 282.0) internal successors, (1974), 7 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:04,147 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 222 flow. Second operand 6 states and 708 transitions. [2023-08-29 20:15:04,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 67 transitions, 475 flow [2023-08-29 20:15:04,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 386 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-08-29 20:15:04,152 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 164 flow [2023-08-29 20:15:04,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=164, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2023-08-29 20:15:04,153 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2023-08-29 20:15:04,153 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 164 flow [2023-08-29 20:15:04,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.83333333333333) internal successors, (689), 6 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:04,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:15:04,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:15:04,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-29 20:15:04,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:15:04,364 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:15:04,364 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:15:04,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1421116001, now seen corresponding path program 1 times [2023-08-29 20:15:04,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:15:04,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95113875] [2023-08-29 20:15:04,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:15:04,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:15:04,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:15:04,366 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:15:04,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-29 20:15:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:15:04,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:15:04,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:15:04,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:15:04,529 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:15:04,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:15:04,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95113875] [2023-08-29 20:15:04,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95113875] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:15:04,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:15:04,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:15:04,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971135881] [2023-08-29 20:15:04,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:15:04,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:15:04,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:15:04,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:15:04,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:15:04,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 282 [2023-08-29 20:15:04,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:04,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:15:04,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 282 [2023-08-29 20:15:04,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:15:04,769 INFO L130 PetriNetUnfolder]: 1263/2030 cut-off events. [2023-08-29 20:15:04,769 INFO L131 PetriNetUnfolder]: For 1187/1187 co-relation queries the response was YES. [2023-08-29 20:15:04,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5367 conditions, 2030 events. 1263/2030 cut-off events. For 1187/1187 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 11181 event pairs, 158 based on Foata normal form. 1/2018 useless extension candidates. Maximal degree in co-relation 5359. Up to 1161 conditions per place. [2023-08-29 20:15:04,778 INFO L137 encePairwiseOnDemand]: 279/282 looper letters, 49 selfloop transitions, 1 changer transitions 32/87 dead transitions. [2023-08-29 20:15:04,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 87 transitions, 532 flow [2023-08-29 20:15:04,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:15:04,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:15:04,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 561 transitions. [2023-08-29 20:15:04,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4973404255319149 [2023-08-29 20:15:04,781 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 561 transitions. [2023-08-29 20:15:04,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 561 transitions. [2023-08-29 20:15:04,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:15:04,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 561 transitions. [2023-08-29 20:15:04,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.25) internal successors, (561), 4 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:04,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:04,784 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:04,785 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 164 flow. Second operand 4 states and 561 transitions. [2023-08-29 20:15:04,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 87 transitions, 532 flow [2023-08-29 20:15:04,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 87 transitions, 520 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:15:04,795 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 164 flow [2023-08-29 20:15:04,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2023-08-29 20:15:04,796 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2023-08-29 20:15:04,796 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 164 flow [2023-08-29 20:15:04,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:04,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:15:04,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:15:04,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-29 20:15:05,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:15:05,011 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:15:05,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:15:05,012 INFO L85 PathProgramCache]: Analyzing trace with hash -2128435449, now seen corresponding path program 2 times [2023-08-29 20:15:05,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:15:05,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385750742] [2023-08-29 20:15:05,012 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:15:05,012 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:15:05,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:15:05,014 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:15:05,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-29 20:15:05,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:15:05,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:15:05,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-29 20:15:05,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:15:05,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:15:05,673 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:15:05,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:15:05,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385750742] [2023-08-29 20:15:05,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [385750742] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:15:05,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:15:05,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 20:15:05,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969059742] [2023-08-29 20:15:05,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:15:05,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 20:15:05,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:15:05,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 20:15:05,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-08-29 20:15:05,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 282 [2023-08-29 20:15:05,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 164 flow. Second operand has 10 states, 10 states have (on average 127.4) internal successors, (1274), 10 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:05,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:15:05,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 282 [2023-08-29 20:15:05,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:15:06,181 INFO L130 PetriNetUnfolder]: 1584/2624 cut-off events. [2023-08-29 20:15:06,181 INFO L131 PetriNetUnfolder]: For 1881/1881 co-relation queries the response was YES. [2023-08-29 20:15:06,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7081 conditions, 2624 events. 1584/2624 cut-off events. For 1881/1881 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 14687 event pairs, 515 based on Foata normal form. 1/2585 useless extension candidates. Maximal degree in co-relation 7071. Up to 1224 conditions per place. [2023-08-29 20:15:06,192 INFO L137 encePairwiseOnDemand]: 275/282 looper letters, 66 selfloop transitions, 7 changer transitions 13/91 dead transitions. [2023-08-29 20:15:06,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 91 transitions, 551 flow [2023-08-29 20:15:06,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:15:06,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:15:06,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 682 transitions. [2023-08-29 20:15:06,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4836879432624113 [2023-08-29 20:15:06,196 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 682 transitions. [2023-08-29 20:15:06,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 682 transitions. [2023-08-29 20:15:06,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:15:06,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 682 transitions. [2023-08-29 20:15:06,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.4) internal successors, (682), 5 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:06,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 282.0) internal successors, (1692), 6 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:06,201 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 282.0) internal successors, (1692), 6 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:06,201 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 164 flow. Second operand 5 states and 682 transitions. [2023-08-29 20:15:06,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 91 transitions, 551 flow [2023-08-29 20:15:06,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 91 transitions, 547 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:15:06,219 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 201 flow [2023-08-29 20:15:06,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=201, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2023-08-29 20:15:06,220 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2023-08-29 20:15:06,220 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 201 flow [2023-08-29 20:15:06,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 127.4) internal successors, (1274), 10 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:06,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:15:06,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:15:06,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-29 20:15:06,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:15:06,432 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:15:06,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:15:06,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1913916181, now seen corresponding path program 3 times [2023-08-29 20:15:06,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:15:06,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1520381807] [2023-08-29 20:15:06,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:15:06,433 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:15:06,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:15:06,434 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:15:06,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-29 20:15:06,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:15:06,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:15:06,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-29 20:15:06,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:15:07,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:15:07,166 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:15:07,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:15:07,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1520381807] [2023-08-29 20:15:07,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1520381807] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:15:07,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:15:07,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 20:15:07,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259148077] [2023-08-29 20:15:07,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:15:07,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 20:15:07,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:15:07,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 20:15:07,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-29 20:15:07,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 282 [2023-08-29 20:15:07,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 201 flow. Second operand has 10 states, 10 states have (on average 128.4) internal successors, (1284), 10 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:07,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:15:07,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 282 [2023-08-29 20:15:07,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:15:07,667 INFO L130 PetriNetUnfolder]: 1672/2716 cut-off events. [2023-08-29 20:15:07,668 INFO L131 PetriNetUnfolder]: For 2933/3019 co-relation queries the response was YES. [2023-08-29 20:15:07,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8698 conditions, 2716 events. 1672/2716 cut-off events. For 2933/3019 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 14771 event pairs, 458 based on Foata normal form. 6/2682 useless extension candidates. Maximal degree in co-relation 8687. Up to 1180 conditions per place. [2023-08-29 20:15:07,680 INFO L137 encePairwiseOnDemand]: 276/282 looper letters, 67 selfloop transitions, 8 changer transitions 13/93 dead transitions. [2023-08-29 20:15:07,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 93 transitions, 596 flow [2023-08-29 20:15:07,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:15:07,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:15:07,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 687 transitions. [2023-08-29 20:15:07,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48723404255319147 [2023-08-29 20:15:07,683 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 687 transitions. [2023-08-29 20:15:07,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 687 transitions. [2023-08-29 20:15:07,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:15:07,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 687 transitions. [2023-08-29 20:15:07,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.4) internal successors, (687), 5 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:07,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 282.0) internal successors, (1692), 6 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:07,688 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 282.0) internal successors, (1692), 6 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:07,688 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 201 flow. Second operand 5 states and 687 transitions. [2023-08-29 20:15:07,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 93 transitions, 596 flow [2023-08-29 20:15:07,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 93 transitions, 591 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:15:07,709 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 230 flow [2023-08-29 20:15:07,709 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=230, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2023-08-29 20:15:07,710 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 6 predicate places. [2023-08-29 20:15:07,710 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 230 flow [2023-08-29 20:15:07,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 128.4) internal successors, (1284), 10 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:07,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:15:07,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:15:07,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-29 20:15:07,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:15:07,921 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:15:07,921 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:15:07,921 INFO L85 PathProgramCache]: Analyzing trace with hash -47639801, now seen corresponding path program 4 times [2023-08-29 20:15:07,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:15:07,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1182823417] [2023-08-29 20:15:07,922 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 20:15:07,922 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:15:07,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:15:07,923 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:15:07,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-29 20:15:08,030 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 20:15:08,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:15:08,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:15:08,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:15:08,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:15:08,070 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:15:08,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:15:08,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1182823417] [2023-08-29 20:15:08,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1182823417] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:15:08,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:15:08,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:15:08,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405542030] [2023-08-29 20:15:08,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:15:08,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:15:08,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:15:08,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:15:08,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:15:08,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 282 [2023-08-29 20:15:08,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 230 flow. Second operand has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:08,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:15:08,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 282 [2023-08-29 20:15:08,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:15:08,512 INFO L130 PetriNetUnfolder]: 2562/4361 cut-off events. [2023-08-29 20:15:08,513 INFO L131 PetriNetUnfolder]: For 5604/5720 co-relation queries the response was YES. [2023-08-29 20:15:08,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14314 conditions, 4361 events. 2562/4361 cut-off events. For 5604/5720 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 27258 event pairs, 508 based on Foata normal form. 45/4367 useless extension candidates. Maximal degree in co-relation 14302. Up to 2051 conditions per place. [2023-08-29 20:15:08,533 INFO L137 encePairwiseOnDemand]: 279/282 looper letters, 68 selfloop transitions, 2 changer transitions 21/97 dead transitions. [2023-08-29 20:15:08,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 97 transitions, 672 flow [2023-08-29 20:15:08,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:15:08,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:15:08,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 559 transitions. [2023-08-29 20:15:08,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49556737588652483 [2023-08-29 20:15:08,536 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 559 transitions. [2023-08-29 20:15:08,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 559 transitions. [2023-08-29 20:15:08,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:15:08,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 559 transitions. [2023-08-29 20:15:08,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:08,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:08,540 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:08,540 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 230 flow. Second operand 4 states and 559 transitions. [2023-08-29 20:15:08,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 97 transitions, 672 flow [2023-08-29 20:15:08,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 97 transitions, 662 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:15:08,592 INFO L231 Difference]: Finished difference. Result has 62 places, 48 transitions, 238 flow [2023-08-29 20:15:08,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=238, PETRI_PLACES=62, PETRI_TRANSITIONS=48} [2023-08-29 20:15:08,592 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 9 predicate places. [2023-08-29 20:15:08,593 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 238 flow [2023-08-29 20:15:08,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:08,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:15:08,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:15:08,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-08-29 20:15:08,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:15:08,804 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:15:08,804 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:15:08,804 INFO L85 PathProgramCache]: Analyzing trace with hash 462708111, now seen corresponding path program 5 times [2023-08-29 20:15:08,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:15:08,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012012333] [2023-08-29 20:15:08,805 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-29 20:15:08,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:15:08,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:15:08,806 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:15:08,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-08-29 20:15:08,924 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:15:08,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:15:08,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:15:08,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:15:08,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:15:08,960 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:15:08,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:15:08,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1012012333] [2023-08-29 20:15:08,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1012012333] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:15:08,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:15:08,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:15:08,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773083587] [2023-08-29 20:15:08,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:15:08,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:15:08,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:15:08,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:15:08,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:15:08,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 282 [2023-08-29 20:15:08,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 48 transitions, 238 flow. Second operand has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:08,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:15:08,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 282 [2023-08-29 20:15:08,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:15:09,542 INFO L130 PetriNetUnfolder]: 3940/6466 cut-off events. [2023-08-29 20:15:09,543 INFO L131 PetriNetUnfolder]: For 8887/8968 co-relation queries the response was YES. [2023-08-29 20:15:09,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22034 conditions, 6466 events. 3940/6466 cut-off events. For 8887/8968 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 41417 event pairs, 1462 based on Foata normal form. 77/6464 useless extension candidates. Maximal degree in co-relation 22020. Up to 2476 conditions per place. [2023-08-29 20:15:09,560 INFO L137 encePairwiseOnDemand]: 279/282 looper letters, 42 selfloop transitions, 1 changer transitions 46/95 dead transitions. [2023-08-29 20:15:09,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 95 transitions, 672 flow [2023-08-29 20:15:09,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:15:09,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:15:09,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 555 transitions. [2023-08-29 20:15:09,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4920212765957447 [2023-08-29 20:15:09,564 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 555 transitions. [2023-08-29 20:15:09,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 555 transitions. [2023-08-29 20:15:09,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:15:09,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 555 transitions. [2023-08-29 20:15:09,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:09,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:09,567 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:09,567 INFO L175 Difference]: Start difference. First operand has 62 places, 48 transitions, 238 flow. Second operand 4 states and 555 transitions. [2023-08-29 20:15:09,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 95 transitions, 672 flow [2023-08-29 20:15:09,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 95 transitions, 670 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:15:09,681 INFO L231 Difference]: Finished difference. Result has 66 places, 45 transitions, 226 flow [2023-08-29 20:15:09,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=66, PETRI_TRANSITIONS=45} [2023-08-29 20:15:09,682 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 13 predicate places. [2023-08-29 20:15:09,682 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 45 transitions, 226 flow [2023-08-29 20:15:09,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:09,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:15:09,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:15:09,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-08-29 20:15:09,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:15:09,893 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:15:09,894 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:15:09,894 INFO L85 PathProgramCache]: Analyzing trace with hash 941658985, now seen corresponding path program 6 times [2023-08-29 20:15:09,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:15:09,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2084363009] [2023-08-29 20:15:09,894 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-29 20:15:09,894 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:15:09,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:15:09,895 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:15:09,896 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 (14)] Waiting until timeout for monitored process [2023-08-29 20:15:09,991 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-08-29 20:15:09,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:15:09,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-29 20:15:09,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:15:10,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:15:10,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:15:10,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:15:10,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2084363009] [2023-08-29 20:15:10,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2084363009] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:15:10,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:15:10,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 20:15:10,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428100859] [2023-08-29 20:15:10,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:15:10,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 20:15:10,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:15:10,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 20:15:10,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-08-29 20:15:10,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 282 [2023-08-29 20:15:10,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 45 transitions, 226 flow. Second operand has 10 states, 10 states have (on average 128.4) internal successors, (1284), 10 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:10,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:15:10,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 282 [2023-08-29 20:15:10,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:15:11,061 INFO L130 PetriNetUnfolder]: 1969/3308 cut-off events. [2023-08-29 20:15:11,061 INFO L131 PetriNetUnfolder]: For 5206/5367 co-relation queries the response was YES. [2023-08-29 20:15:11,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11521 conditions, 3308 events. 1969/3308 cut-off events. For 5206/5367 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 19160 event pairs, 602 based on Foata normal form. 21/3234 useless extension candidates. Maximal degree in co-relation 11505. Up to 1308 conditions per place. [2023-08-29 20:15:11,076 INFO L137 encePairwiseOnDemand]: 277/282 looper letters, 49 selfloop transitions, 3 changer transitions 36/93 dead transitions. [2023-08-29 20:15:11,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 93 transitions, 633 flow [2023-08-29 20:15:11,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:15:11,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:15:11,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 687 transitions. [2023-08-29 20:15:11,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48723404255319147 [2023-08-29 20:15:11,079 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 687 transitions. [2023-08-29 20:15:11,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 687 transitions. [2023-08-29 20:15:11,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:15:11,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 687 transitions. [2023-08-29 20:15:11,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.4) internal successors, (687), 5 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:11,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 282.0) internal successors, (1692), 6 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:11,083 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 282.0) internal successors, (1692), 6 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:11,083 INFO L175 Difference]: Start difference. First operand has 66 places, 45 transitions, 226 flow. Second operand 5 states and 687 transitions. [2023-08-29 20:15:11,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 93 transitions, 633 flow [2023-08-29 20:15:11,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 93 transitions, 619 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-29 20:15:11,127 INFO L231 Difference]: Finished difference. Result has 65 places, 41 transitions, 195 flow [2023-08-29 20:15:11,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=195, PETRI_PLACES=65, PETRI_TRANSITIONS=41} [2023-08-29 20:15:11,128 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 12 predicate places. [2023-08-29 20:15:11,128 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 41 transitions, 195 flow [2023-08-29 20:15:11,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 128.4) internal successors, (1284), 10 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:11,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:15:11,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:15:11,142 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 (14)] Forceful destruction successful, exit code 0 [2023-08-29 20:15:11,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:15:11,340 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:15:11,340 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:15:11,340 INFO L85 PathProgramCache]: Analyzing trace with hash 513787415, now seen corresponding path program 7 times [2023-08-29 20:15:11,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:15:11,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040610623] [2023-08-29 20:15:11,341 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-29 20:15:11,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:15:11,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:15:11,342 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:15:11,344 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 (15)] Waiting until timeout for monitored process [2023-08-29 20:15:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:15:11,454 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:15:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:15:11,597 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:15:11,598 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:15:11,598 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-29 20:15:11,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-29 20:15:11,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-29 20:15:11,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-29 20:15:11,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-29 20:15:11,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-29 20:15:11,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-29 20:15:11,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-29 20:15:11,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-29 20:15:11,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-29 20:15:11,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-29 20:15:11,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-29 20:15:11,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-29 20:15:11,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-29 20:15:11,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-29 20:15:11,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-29 20:15:11,621 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 (15)] Forceful destruction successful, exit code 0 [2023-08-29 20:15:11,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:15:11,821 INFO L445 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:15:11,826 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:15:11,826 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:15:11,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:15:11 BasicIcfg [2023-08-29 20:15:11,925 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:15:11,926 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:15:11,926 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:15:11,926 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:15:11,927 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:14:47" (3/4) ... [2023-08-29 20:15:11,929 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:15:11,929 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:15:11,929 INFO L158 Benchmark]: Toolchain (without parser) took 25754.37ms. Allocated memory was 73.4MB in the beginning and 1.3GB in the end (delta: 1.3GB). Free memory was 48.9MB in the beginning and 466.9MB in the end (delta: -418.0MB). Peak memory consumption was 841.3MB. Max. memory is 16.1GB. [2023-08-29 20:15:11,930 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 56.6MB. Free memory was 35.0MB in the beginning and 35.0MB in the end (delta: 48.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:15:11,930 INFO L158 Benchmark]: CACSL2BoogieTranslator took 564.94ms. Allocated memory is still 73.4MB. Free memory was 48.5MB in the beginning and 42.0MB in the end (delta: 6.5MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2023-08-29 20:15:11,930 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.20ms. Allocated memory is still 73.4MB. Free memory was 42.0MB in the beginning and 39.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:15:11,931 INFO L158 Benchmark]: Boogie Preprocessor took 54.94ms. Allocated memory is still 73.4MB. Free memory was 39.3MB in the beginning and 36.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:15:11,933 INFO L158 Benchmark]: RCFGBuilder took 744.96ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 36.9MB in the beginning and 53.3MB in the end (delta: -16.4MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2023-08-29 20:15:11,933 INFO L158 Benchmark]: TraceAbstraction took 24307.35ms. Allocated memory was 88.1MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 52.7MB in the beginning and 466.9MB in the end (delta: -414.2MB). Peak memory consumption was 827.9MB. Max. memory is 16.1GB. [2023-08-29 20:15:11,933 INFO L158 Benchmark]: Witness Printer took 3.11ms. Allocated memory is still 1.3GB. Free memory is still 466.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:15:11,935 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.17ms. Allocated memory is still 56.6MB. Free memory was 35.0MB in the beginning and 35.0MB in the end (delta: 48.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 564.94ms. Allocated memory is still 73.4MB. Free memory was 48.5MB in the beginning and 42.0MB in the end (delta: 6.5MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.20ms. Allocated memory is still 73.4MB. Free memory was 42.0MB in the beginning and 39.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.94ms. Allocated memory is still 73.4MB. Free memory was 39.3MB in the beginning and 36.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 744.96ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 36.9MB in the beginning and 53.3MB in the end (delta: -16.4MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * TraceAbstraction took 24307.35ms. Allocated memory was 88.1MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 52.7MB in the beginning and 466.9MB in the end (delta: -414.2MB). Peak memory consumption was 827.9MB. Max. memory is 16.1GB. * Witness Printer took 3.11ms. Allocated memory is still 1.3GB. Free memory is still 466.9MB. 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: 7.8s, 153 PlacesBefore, 53 PlacesAfterwards, 142 TransitionsBefore, 40 TransitionsAfterwards, 3638 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 70 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 136 TotalNumberOfCompositions, 11021 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4641, independent: 4377, independent conditional: 0, independent unconditional: 4377, dependent: 264, dependent conditional: 0, dependent unconditional: 264, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1939, independent: 1874, independent conditional: 0, independent unconditional: 1874, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4641, independent: 2503, independent conditional: 0, independent unconditional: 2503, dependent: 199, dependent conditional: 0, dependent unconditional: 199, unknown: 1939, unknown conditional: 0, unknown unconditional: 1939] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 182, Positive conditional cache size: 0, Positive unconditional cache size: 182, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t145; [L859] FCALL, FORK 0 pthread_create(&t145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t145, ((void *)0), P0, ((void *)0))=0, t145={-2145385485:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L860] 0 pthread_t t146; [L861] FCALL, FORK 0 pthread_create(&t146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t146, ((void *)0), P1, ((void *)0))=1, t145={-2145385485:0}, t146={-2145385481:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L862] 0 pthread_t t147; [L863] FCALL, FORK 0 pthread_create(&t147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t147, ((void *)0), P2, ((void *)0))=2, t145={-2145385485:0}, t146={-2145385481:0}, t147={2098175:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L864] 0 pthread_t t148; [L865] FCALL, FORK 0 pthread_create(&t148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t148, ((void *)0), P3, ((void *)0))=3, t145={-2145385485:0}, t146={-2145385481:0}, t147={2098175:0}, t148={-2145385473:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L760] 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) [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] 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 [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] 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=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L813] 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) [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] 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 [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] 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=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L790] 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) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 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 [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 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=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 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) [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] 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 [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t145={-2145385485:0}, t146={-2145385481:0}, t147={2098175:0}, t148={-2145385473:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L883] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L884] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L885] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L886] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L888] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 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: 856]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 863]: 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: 859]: 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: 865]: 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: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 184 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.1s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 760 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 637 mSDsluCounter, 336 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 306 mSDsCounter, 238 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2714 IncrementalHoareTripleChecker+Invalid, 2952 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 238 mSolverCounterUnsat, 30 mSDtfsCounter, 2714 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 275 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=238occurred in iteration=11, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 307 NumberOfCodeBlocks, 307 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 265 ConstructedInterpolants, 12 QuantifiedInterpolants, 3177 SizeOfPredicates, 15 NumberOfNonLiveVariables, 2198 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 20:15:11,971 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