./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a650c00976061981bc34910bafee4d11d94c16289374f008af5a1f8d17e97036 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:59:33,233 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:59:33,236 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:59:33,278 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:59:33,278 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:59:33,281 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:59:33,283 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:59:33,285 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:59:33,287 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:59:33,291 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:59:33,292 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:59:33,295 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:59:33,295 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:59:33,297 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:59:33,298 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:59:33,303 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:59:33,304 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:59:33,305 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:59:33,306 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:59:33,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:59:33,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:59:33,318 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:59:33,321 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:59:33,322 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:59:33,328 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:59:33,329 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:59:33,329 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:59:33,331 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:59:33,332 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:59:33,332 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:59:33,333 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:59:33,334 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:59:33,336 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:59:33,337 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:59:33,338 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:59:33,338 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:59:33,339 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:59:33,339 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:59:33,339 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:59:33,340 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:59:33,340 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:59:33,342 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 02:59:33,375 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:59:33,375 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:59:33,376 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:59:33,376 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:59:33,377 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:59:33,377 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:59:33,378 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:59:33,378 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:59:33,378 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:59:33,378 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:59:33,379 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:59:33,379 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:59:33,380 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:59:33,380 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:59:33,380 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:59:33,380 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:59:33,380 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:59:33,381 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:59:33,381 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:59:33,381 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:59:33,381 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:59:33,381 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:59:33,382 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:59:33,382 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:59:33,382 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:59:33,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:59:33,382 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:59:33,382 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:59:33,383 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 02:59:33,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 02:59:33,383 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:59:33,383 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:59:33,384 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:59:33,384 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:59:33,384 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 -> a650c00976061981bc34910bafee4d11d94c16289374f008af5a1f8d17e97036 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 -> TOGETHER [2023-08-30 02:59:33,722 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:59:33,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:59:33,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:59:33,754 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:59:33,754 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:59:33,756 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-30 02:59:35,062 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:59:35,341 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:59:35,342 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-30 02:59:35,363 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd460f64f/29fcc0b9d95a4d1090e3fb3f96bc3033/FLAG7d6e407fc [2023-08-30 02:59:35,388 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd460f64f/29fcc0b9d95a4d1090e3fb3f96bc3033 [2023-08-30 02:59:35,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:59:35,391 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:59:35,394 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:59:35,394 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:59:35,399 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:59:35,399 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:59:35" (1/1) ... [2023-08-30 02:59:35,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d3ce467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:59:35, skipping insertion in model container [2023-08-30 02:59:35,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:59:35" (1/1) ... [2023-08-30 02:59:35,406 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:59:35,455 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:59:35,613 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2023-08-30 02:59:35,854 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:59:35,865 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:59:35,876 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2023-08-30 02:59:35,935 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:59:35,973 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:59:35,974 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:59:35,979 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:59:35,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:59:35 WrapperNode [2023-08-30 02:59:35,980 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:59:35,981 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:59:35,981 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:59:35,982 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:59:35,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:59:35" (1/1) ... [2023-08-30 02:59:36,018 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:59:35" (1/1) ... [2023-08-30 02:59:36,058 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2023-08-30 02:59:36,059 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:59:36,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:59:36,060 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:59:36,060 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:59:36,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:59:35" (1/1) ... [2023-08-30 02:59:36,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:59:35" (1/1) ... [2023-08-30 02:59:36,082 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:59:35" (1/1) ... [2023-08-30 02:59:36,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:59:35" (1/1) ... [2023-08-30 02:59:36,100 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:59:35" (1/1) ... [2023-08-30 02:59:36,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:59:35" (1/1) ... [2023-08-30 02:59:36,111 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:59:35" (1/1) ... [2023-08-30 02:59:36,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:59:35" (1/1) ... [2023-08-30 02:59:36,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:59:36,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:59:36,115 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:59:36,115 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:59:36,116 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:59:35" (1/1) ... [2023-08-30 02:59:36,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:59:36,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:59:36,152 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-30 02:59:36,169 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-30 02:59:36,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 02:59:36,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:59:36,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:59:36,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:59:36,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:59:36,192 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:59:36,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:59:36,192 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:59:36,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:59:36,192 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:59:36,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:59:36,193 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 02:59:36,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 02:59:36,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 02:59:36,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:59:36,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:59:36,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:59:36,195 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 02:59:36,395 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:59:36,396 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:59:36,680 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:59:36,806 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:59:36,806 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:59:36,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:59:36 BoogieIcfgContainer [2023-08-30 02:59:36,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:59:36,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:59:36,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:59:36,814 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:59:36,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:59:35" (1/3) ... [2023-08-30 02:59:36,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1a7107 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:59:36, skipping insertion in model container [2023-08-30 02:59:36,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:59:35" (2/3) ... [2023-08-30 02:59:36,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1a7107 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:59:36, skipping insertion in model container [2023-08-30 02:59:36,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:59:36" (3/3) ... [2023-08-30 02:59:36,816 INFO L112 eAbstractionObserver]: Analyzing ICFG mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-30 02:59:36,837 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:59:36,838 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-30 02:59:36,838 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:59:36,910 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:59:36,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2023-08-30 02:59:37,018 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2023-08-30 02:59:37,019 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:59:37,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-08-30 02:59:37,025 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 137 transitions, 294 flow [2023-08-30 02:59:37,029 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 133 transitions, 278 flow [2023-08-30 02:59:37,041 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:59:37,048 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 133 transitions, 278 flow [2023-08-30 02:59:37,051 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 133 transitions, 278 flow [2023-08-30 02:59:37,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 278 flow [2023-08-30 02:59:37,078 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2023-08-30 02:59:37,078 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:59:37,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-08-30 02:59:37,081 INFO L119 LiptonReduction]: Number of co-enabled transitions 3046 [2023-08-30 02:59:41,540 INFO L134 LiptonReduction]: Checked pairs total: 8042 [2023-08-30 02:59:41,540 INFO L136 LiptonReduction]: Total number of compositions: 120 [2023-08-30 02:59:41,555 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:59:41,561 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;@7d94c3c8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:59:41,562 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-30 02:59:41,564 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 02:59:41,564 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:59:41,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:59:41,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:59:41,572 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:59:41,579 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:59:41,579 INFO L85 PathProgramCache]: Analyzing trace with hash 559, now seen corresponding path program 1 times [2023-08-30 02:59:41,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:59:41,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38951951] [2023-08-30 02:59:41,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:59:41,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:59:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:59:41,693 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-30 02:59:41,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:59:41,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38951951] [2023-08-30 02:59:41,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38951951] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:59:41,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:59:41,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:59:41,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775917433] [2023-08-30 02:59:41,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:59:41,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:59:41,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:59:41,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:59:41,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:59:41,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 257 [2023-08-30 02:59:41,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 124.5) internal successors, (249), 2 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:41,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:59:41,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 257 [2023-08-30 02:59:41,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:59:42,600 INFO L130 PetriNetUnfolder]: 4151/5795 cut-off events. [2023-08-30 02:59:42,600 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2023-08-30 02:59:42,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11587 conditions, 5795 events. 4151/5795 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 30059 event pairs, 4151 based on Foata normal form. 180/5107 useless extension candidates. Maximal degree in co-relation 11575. Up to 5689 conditions per place. [2023-08-30 02:59:42,644 INFO L137 encePairwiseOnDemand]: 248/257 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2023-08-30 02:59:42,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 124 flow [2023-08-30 02:59:42,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:59:42,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:59:42,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 283 transitions. [2023-08-30 02:59:42,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5505836575875487 [2023-08-30 02:59:42,663 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 283 transitions. [2023-08-30 02:59:42,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 283 transitions. [2023-08-30 02:59:42,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:59:42,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 283 transitions. [2023-08-30 02:59:42,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 141.5) internal successors, (283), 2 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:42,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:42,677 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:42,679 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 283 transitions. [2023-08-30 02:59:42,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 124 flow [2023-08-30 02:59:42,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:59:42,686 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2023-08-30 02:59:42,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-30 02:59:42,691 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2023-08-30 02:59:42,692 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2023-08-30 02:59:42,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 124.5) internal successors, (249), 2 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:42,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:59:42,694 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:59:42,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 02:59:42,697 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:59:42,698 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:59:42,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1630553399, now seen corresponding path program 1 times [2023-08-30 02:59:42,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:59:42,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767688850] [2023-08-30 02:59:42,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:59:42,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:59:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:59:43,072 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-30 02:59:43,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:59:43,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767688850] [2023-08-30 02:59:43,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767688850] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:59:43,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:59:43,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:59:43,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984954123] [2023-08-30 02:59:43,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:59:43,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:59:43,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:59:43,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:59:43,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:59:43,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 257 [2023-08-30 02:59:43,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:43,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:59:43,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 257 [2023-08-30 02:59:43,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:59:43,618 INFO L130 PetriNetUnfolder]: 3299/4862 cut-off events. [2023-08-30 02:59:43,618 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:59:43,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9511 conditions, 4862 events. 3299/4862 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 27179 event pairs, 743 based on Foata normal form. 0/4417 useless extension candidates. Maximal degree in co-relation 9508. Up to 3421 conditions per place. [2023-08-30 02:59:43,643 INFO L137 encePairwiseOnDemand]: 254/257 looper letters, 33 selfloop transitions, 2 changer transitions 4/43 dead transitions. [2023-08-30 02:59:43,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 172 flow [2023-08-30 02:59:43,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:59:43,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:59:43,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2023-08-30 02:59:43,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5304798962386511 [2023-08-30 02:59:43,646 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 409 transitions. [2023-08-30 02:59:43,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 409 transitions. [2023-08-30 02:59:43,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:59:43,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 409 transitions. [2023-08-30 02:59:43,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:43,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 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-30 02:59:43,650 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 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-30 02:59:43,650 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 409 transitions. [2023-08-30 02:59:43,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 172 flow [2023-08-30 02:59:43,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:59:43,652 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 66 flow [2023-08-30 02:59:43,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2023-08-30 02:59:43,653 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-08-30 02:59:43,653 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 66 flow [2023-08-30 02:59:43,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:43,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:59:43,654 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:59:43,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 02:59:43,654 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:59:43,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:59:43,655 INFO L85 PathProgramCache]: Analyzing trace with hash 266140528, now seen corresponding path program 1 times [2023-08-30 02:59:43,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:59:43,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052847725] [2023-08-30 02:59:43,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:59:43,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:59:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:59:44,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-30 02:59:44,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:59:44,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052847725] [2023-08-30 02:59:44,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052847725] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:59:44,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:59:44,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:59:44,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114612724] [2023-08-30 02:59:44,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:59:44,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:59:44,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:59:44,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:59:44,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:59:44,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-30 02:59:44,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 66 flow. Second operand has 6 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:44,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:59:44,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-30 02:59:44,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:59:45,033 INFO L130 PetriNetUnfolder]: 2075/2976 cut-off events. [2023-08-30 02:59:45,033 INFO L131 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2023-08-30 02:59:45,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6151 conditions, 2976 events. 2075/2976 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 14690 event pairs, 435 based on Foata normal form. 0/2940 useless extension candidates. Maximal degree in co-relation 6147. Up to 2763 conditions per place. [2023-08-30 02:59:45,050 INFO L137 encePairwiseOnDemand]: 252/257 looper letters, 31 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2023-08-30 02:59:45,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 39 transitions, 160 flow [2023-08-30 02:59:45,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:59:45,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:59:45,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 666 transitions. [2023-08-30 02:59:45,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43190661478599224 [2023-08-30 02:59:45,053 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 666 transitions. [2023-08-30 02:59:45,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 666 transitions. [2023-08-30 02:59:45,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:59:45,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 666 transitions. [2023-08-30 02:59:45,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:45,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:45,059 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:45,059 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 66 flow. Second operand 6 states and 666 transitions. [2023-08-30 02:59:45,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 39 transitions, 160 flow [2023-08-30 02:59:45,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 39 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:59:45,070 INFO L231 Difference]: Finished difference. Result has 41 places, 26 transitions, 68 flow [2023-08-30 02:59:45,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2023-08-30 02:59:45,071 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-08-30 02:59:45,071 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 68 flow [2023-08-30 02:59:45,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:45,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:59:45,072 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:59:45,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 02:59:45,072 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:59:45,072 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:59:45,073 INFO L85 PathProgramCache]: Analyzing trace with hash 266140448, now seen corresponding path program 1 times [2023-08-30 02:59:45,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:59:45,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074901606] [2023-08-30 02:59:45,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:59:45,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:59:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:59:45,953 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-30 02:59:45,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:59:45,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074901606] [2023-08-30 02:59:45,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074901606] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:59:45,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:59:45,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:59:45,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772524331] [2023-08-30 02:59:45,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:59:45,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:59:45,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:59:45,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:59:45,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:59:46,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 257 [2023-08-30 02:59:46,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 26 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:46,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:59:46,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 257 [2023-08-30 02:59:46,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:59:47,316 INFO L130 PetriNetUnfolder]: 8593/12282 cut-off events. [2023-08-30 02:59:47,316 INFO L131 PetriNetUnfolder]: For 109/109 co-relation queries the response was YES. [2023-08-30 02:59:47,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24579 conditions, 12282 events. 8593/12282 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 69533 event pairs, 609 based on Foata normal form. 532/12814 useless extension candidates. Maximal degree in co-relation 24575. Up to 6487 conditions per place. [2023-08-30 02:59:47,383 INFO L137 encePairwiseOnDemand]: 245/257 looper letters, 47 selfloop transitions, 12 changer transitions 38/98 dead transitions. [2023-08-30 02:59:47,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 98 transitions, 418 flow [2023-08-30 02:59:47,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:59:47,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:59:47,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 856 transitions. [2023-08-30 02:59:47,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47581989994441354 [2023-08-30 02:59:47,388 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 856 transitions. [2023-08-30 02:59:47,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 856 transitions. [2023-08-30 02:59:47,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:59:47,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 856 transitions. [2023-08-30 02:59:47,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:47,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:47,394 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:47,394 INFO L175 Difference]: Start difference. First operand has 41 places, 26 transitions, 68 flow. Second operand 7 states and 856 transitions. [2023-08-30 02:59:47,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 98 transitions, 418 flow [2023-08-30 02:59:47,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 98 transitions, 407 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:59:47,398 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 171 flow [2023-08-30 02:59:47,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=171, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2023-08-30 02:59:47,399 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2023-08-30 02:59:47,399 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 171 flow [2023-08-30 02:59:47,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:47,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:59:47,400 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:59:47,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 02:59:47,400 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:59:47,401 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:59:47,401 INFO L85 PathProgramCache]: Analyzing trace with hash -339602268, now seen corresponding path program 1 times [2023-08-30 02:59:47,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:59:47,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879175843] [2023-08-30 02:59:47,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:59:47,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:59:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:59:48,102 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-30 02:59:48,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:59:48,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879175843] [2023-08-30 02:59:48,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879175843] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:59:48,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:59:48,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:59:48,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773893126] [2023-08-30 02:59:48,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:59:48,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:59:48,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:59:48,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:59:48,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:59:48,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 257 [2023-08-30 02:59:48,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 171 flow. Second operand has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:48,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:59:48,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 257 [2023-08-30 02:59:48,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:59:49,235 INFO L130 PetriNetUnfolder]: 7916/11277 cut-off events. [2023-08-30 02:59:49,236 INFO L131 PetriNetUnfolder]: For 12304/12324 co-relation queries the response was YES. [2023-08-30 02:59:49,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35029 conditions, 11277 events. 7916/11277 cut-off events. For 12304/12324 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 63098 event pairs, 767 based on Foata normal form. 410/11685 useless extension candidates. Maximal degree in co-relation 35020. Up to 6245 conditions per place. [2023-08-30 02:59:49,414 INFO L137 encePairwiseOnDemand]: 245/257 looper letters, 53 selfloop transitions, 21 changer transitions 34/109 dead transitions. [2023-08-30 02:59:49,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 109 transitions, 695 flow [2023-08-30 02:59:49,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:59:49,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:59:49,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 856 transitions. [2023-08-30 02:59:49,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47581989994441354 [2023-08-30 02:59:49,418 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 856 transitions. [2023-08-30 02:59:49,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 856 transitions. [2023-08-30 02:59:49,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:59:49,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 856 transitions. [2023-08-30 02:59:49,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:49,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:49,426 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:49,426 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 171 flow. Second operand 7 states and 856 transitions. [2023-08-30 02:59:49,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 109 transitions, 695 flow [2023-08-30 02:59:49,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 109 transitions, 691 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-30 02:59:49,456 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 341 flow [2023-08-30 02:59:49,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=341, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2023-08-30 02:59:49,458 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 6 predicate places. [2023-08-30 02:59:49,459 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 341 flow [2023-08-30 02:59:49,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:49,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:59:49,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:59:49,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 02:59:49,460 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:59:49,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:59:49,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1974070587, now seen corresponding path program 1 times [2023-08-30 02:59:49,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:59:49,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252834645] [2023-08-30 02:59:49,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:59:49,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:59:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:59:50,203 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-30 02:59:50,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:59:50,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252834645] [2023-08-30 02:59:50,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252834645] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:59:50,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:59:50,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:59:50,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335503690] [2023-08-30 02:59:50,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:59:50,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:59:50,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:59:50,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:59:50,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:59:50,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 257 [2023-08-30 02:59:50,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 341 flow. Second operand has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:50,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:59:50,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 257 [2023-08-30 02:59:50,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:59:51,488 INFO L130 PetriNetUnfolder]: 9653/13736 cut-off events. [2023-08-30 02:59:51,488 INFO L131 PetriNetUnfolder]: For 37144/37144 co-relation queries the response was YES. [2023-08-30 02:59:51,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52058 conditions, 13736 events. 9653/13736 cut-off events. For 37144/37144 co-relation queries the response was YES. Maximal size of possible extension queue 587. Compared 78230 event pairs, 1953 based on Foata normal form. 420/14156 useless extension candidates. Maximal degree in co-relation 52044. Up to 5521 conditions per place. [2023-08-30 02:59:51,586 INFO L137 encePairwiseOnDemand]: 245/257 looper letters, 58 selfloop transitions, 27 changer transitions 35/121 dead transitions. [2023-08-30 02:59:51,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 121 transitions, 1003 flow [2023-08-30 02:59:51,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:59:51,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:59:51,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 852 transitions. [2023-08-30 02:59:51,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4735964424680378 [2023-08-30 02:59:51,590 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 852 transitions. [2023-08-30 02:59:51,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 852 transitions. [2023-08-30 02:59:51,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:59:51,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 852 transitions. [2023-08-30 02:59:51,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.71428571428571) internal successors, (852), 7 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:51,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:51,597 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:51,597 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 341 flow. Second operand 7 states and 852 transitions. [2023-08-30 02:59:51,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 121 transitions, 1003 flow [2023-08-30 02:59:51,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 121 transitions, 979 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-30 02:59:51,641 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 579 flow [2023-08-30 02:59:51,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=579, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2023-08-30 02:59:51,644 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 12 predicate places. [2023-08-30 02:59:51,644 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 579 flow [2023-08-30 02:59:51,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:51,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:59:51,645 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:59:51,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 02:59:51,645 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:59:51,646 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:59:51,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1971925635, now seen corresponding path program 1 times [2023-08-30 02:59:51,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:59:51,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962006015] [2023-08-30 02:59:51,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:59:51,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:59:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:59:52,184 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-30 02:59:52,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:59:52,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962006015] [2023-08-30 02:59:52,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962006015] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:59:52,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:59:52,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:59:52,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318236484] [2023-08-30 02:59:52,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:59:52,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:59:52,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:59:52,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:59:52,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:59:52,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 257 [2023-08-30 02:59:52,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 579 flow. Second operand has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:52,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:59:52,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 257 [2023-08-30 02:59:52,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:59:53,348 INFO L130 PetriNetUnfolder]: 9742/14200 cut-off events. [2023-08-30 02:59:53,348 INFO L131 PetriNetUnfolder]: For 68291/69997 co-relation queries the response was YES. [2023-08-30 02:59:53,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58789 conditions, 14200 events. 9742/14200 cut-off events. For 68291/69997 co-relation queries the response was YES. Maximal size of possible extension queue 724. Compared 86837 event pairs, 2537 based on Foata normal form. 1259/15290 useless extension candidates. Maximal degree in co-relation 58772. Up to 9986 conditions per place. [2023-08-30 02:59:53,453 INFO L137 encePairwiseOnDemand]: 252/257 looper letters, 63 selfloop transitions, 6 changer transitions 28/112 dead transitions. [2023-08-30 02:59:53,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 112 transitions, 1232 flow [2023-08-30 02:59:53,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:59:53,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:59:53,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 650 transitions. [2023-08-30 02:59:53,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5058365758754864 [2023-08-30 02:59:53,456 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 650 transitions. [2023-08-30 02:59:53,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 650 transitions. [2023-08-30 02:59:53,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:59:53,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 650 transitions. [2023-08-30 02:59:53,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:53,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:53,461 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:53,461 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 579 flow. Second operand 5 states and 650 transitions. [2023-08-30 02:59:53,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 112 transitions, 1232 flow [2023-08-30 02:59:53,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 112 transitions, 1180 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 02:59:53,541 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 625 flow [2023-08-30 02:59:53,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=625, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2023-08-30 02:59:53,542 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2023-08-30 02:59:53,542 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 625 flow [2023-08-30 02:59:53,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:53,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:59:53,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:59:53,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 02:59:53,543 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:59:53,543 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:59:53,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1430227315, now seen corresponding path program 1 times [2023-08-30 02:59:53,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:59:53,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093024278] [2023-08-30 02:59:53,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:59:53,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:59:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:59:53,943 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-30 02:59:53,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:59:53,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093024278] [2023-08-30 02:59:53,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093024278] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:59:53,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:59:53,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:59:53,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440968493] [2023-08-30 02:59:53,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:59:53,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:59:53,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:59:53,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:59:53,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:59:53,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 257 [2023-08-30 02:59:53,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 625 flow. Second operand has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:53,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:59:53,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 257 [2023-08-30 02:59:53,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:59:55,437 INFO L130 PetriNetUnfolder]: 9261/13785 cut-off events. [2023-08-30 02:59:55,437 INFO L131 PetriNetUnfolder]: For 64068/64840 co-relation queries the response was YES. [2023-08-30 02:59:55,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61519 conditions, 13785 events. 9261/13785 cut-off events. For 64068/64840 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 86286 event pairs, 1416 based on Foata normal form. 761/14425 useless extension candidates. Maximal degree in co-relation 61499. Up to 8660 conditions per place. [2023-08-30 02:59:55,565 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 73 selfloop transitions, 16 changer transitions 31/135 dead transitions. [2023-08-30 02:59:55,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 135 transitions, 1459 flow [2023-08-30 02:59:55,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:59:55,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:59:55,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 888 transitions. [2023-08-30 02:59:55,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4936075597554197 [2023-08-30 02:59:55,569 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 888 transitions. [2023-08-30 02:59:55,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 888 transitions. [2023-08-30 02:59:55,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:59:55,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 888 transitions. [2023-08-30 02:59:55,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.85714285714286) internal successors, (888), 7 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:55,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:55,576 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:55,576 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 625 flow. Second operand 7 states and 888 transitions. [2023-08-30 02:59:55,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 135 transitions, 1459 flow [2023-08-30 02:59:55,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 135 transitions, 1448 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 02:59:55,696 INFO L231 Difference]: Finished difference. Result has 72 places, 73 transitions, 804 flow [2023-08-30 02:59:55,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=804, PETRI_PLACES=72, PETRI_TRANSITIONS=73} [2023-08-30 02:59:55,699 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 21 predicate places. [2023-08-30 02:59:55,699 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 73 transitions, 804 flow [2023-08-30 02:59:55,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:55,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:59:55,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:59:55,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 02:59:55,700 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:59:55,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:59:55,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1432187755, now seen corresponding path program 2 times [2023-08-30 02:59:55,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:59:55,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172564888] [2023-08-30 02:59:55,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:59:55,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:59:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:59:56,142 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-30 02:59:56,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:59:56,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172564888] [2023-08-30 02:59:56,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172564888] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:59:56,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:59:56,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:59:56,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725525335] [2023-08-30 02:59:56,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:59:56,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:59:56,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:59:56,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:59:56,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:59:56,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 257 [2023-08-30 02:59:56,177 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 73 transitions, 804 flow. Second operand has 6 states, 6 states have (on average 120.5) internal successors, (723), 6 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:56,177 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:59:56,178 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 257 [2023-08-30 02:59:56,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:59:57,440 INFO L130 PetriNetUnfolder]: 8838/13176 cut-off events. [2023-08-30 02:59:57,440 INFO L131 PetriNetUnfolder]: For 84500/85421 co-relation queries the response was YES. [2023-08-30 02:59:57,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63494 conditions, 13176 events. 8838/13176 cut-off events. For 84500/85421 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 80441 event pairs, 1089 based on Foata normal form. 894/14027 useless extension candidates. Maximal degree in co-relation 63470. Up to 8489 conditions per place. [2023-08-30 02:59:57,552 INFO L137 encePairwiseOnDemand]: 252/257 looper letters, 80 selfloop transitions, 13 changer transitions 24/132 dead transitions. [2023-08-30 02:59:57,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 132 transitions, 1587 flow [2023-08-30 02:59:57,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:59:57,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:59:57,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 768 transitions. [2023-08-30 02:59:57,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4980544747081712 [2023-08-30 02:59:57,560 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 768 transitions. [2023-08-30 02:59:57,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 768 transitions. [2023-08-30 02:59:57,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:59:57,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 768 transitions. [2023-08-30 02:59:57,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:57,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:57,567 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:57,567 INFO L175 Difference]: Start difference. First operand has 72 places, 73 transitions, 804 flow. Second operand 6 states and 768 transitions. [2023-08-30 02:59:57,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 132 transitions, 1587 flow [2023-08-30 02:59:57,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 132 transitions, 1564 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-30 02:59:57,698 INFO L231 Difference]: Finished difference. Result has 74 places, 76 transitions, 868 flow [2023-08-30 02:59:57,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=868, PETRI_PLACES=74, PETRI_TRANSITIONS=76} [2023-08-30 02:59:57,699 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 23 predicate places. [2023-08-30 02:59:57,699 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 76 transitions, 868 flow [2023-08-30 02:59:57,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.5) internal successors, (723), 6 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:57,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:59:57,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:59:57,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 02:59:57,700 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:59:57,701 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:59:57,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1387411706, now seen corresponding path program 1 times [2023-08-30 02:59:57,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:59:57,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366183336] [2023-08-30 02:59:57,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:59:57,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:59:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:59:58,154 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-30 02:59:58,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:59:58,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366183336] [2023-08-30 02:59:58,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366183336] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:59:58,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:59:58,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:59:58,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556291439] [2023-08-30 02:59:58,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:59:58,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:59:58,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:59:58,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:59:58,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:59:58,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 257 [2023-08-30 02:59:58,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 76 transitions, 868 flow. Second operand has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:58,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:59:58,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 257 [2023-08-30 02:59:58,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:59:59,885 INFO L130 PetriNetUnfolder]: 9279/13660 cut-off events. [2023-08-30 02:59:59,885 INFO L131 PetriNetUnfolder]: For 90667/92061 co-relation queries the response was YES. [2023-08-30 02:59:59,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66974 conditions, 13660 events. 9279/13660 cut-off events. For 90667/92061 co-relation queries the response was YES. Maximal size of possible extension queue 587. Compared 82742 event pairs, 1770 based on Foata normal form. 862/14367 useless extension candidates. Maximal degree in co-relation 66949. Up to 8902 conditions per place. [2023-08-30 03:00:00,008 INFO L137 encePairwiseOnDemand]: 249/257 looper letters, 78 selfloop transitions, 28 changer transitions 13/134 dead transitions. [2023-08-30 03:00:00,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 134 transitions, 1637 flow [2023-08-30 03:00:00,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 03:00:00,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 03:00:00,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 745 transitions. [2023-08-30 03:00:00,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48313878080415046 [2023-08-30 03:00:00,011 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 745 transitions. [2023-08-30 03:00:00,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 745 transitions. [2023-08-30 03:00:00,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:00:00,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 745 transitions. [2023-08-30 03:00:00,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:00,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:00,016 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:00,017 INFO L175 Difference]: Start difference. First operand has 74 places, 76 transitions, 868 flow. Second operand 6 states and 745 transitions. [2023-08-30 03:00:00,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 134 transitions, 1637 flow [2023-08-30 03:00:00,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 134 transitions, 1619 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-30 03:00:00,160 INFO L231 Difference]: Finished difference. Result has 76 places, 85 transitions, 1068 flow [2023-08-30 03:00:00,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1068, PETRI_PLACES=76, PETRI_TRANSITIONS=85} [2023-08-30 03:00:00,161 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 25 predicate places. [2023-08-30 03:00:00,162 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 85 transitions, 1068 flow [2023-08-30 03:00:00,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:00,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:00:00,162 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:00:00,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 03:00:00,163 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 03:00:00,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:00:00,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1448733116, now seen corresponding path program 2 times [2023-08-30 03:00:00,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:00:00,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349885997] [2023-08-30 03:00:00,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:00:00,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:00:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:00:00,659 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-30 03:00:00,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:00:00,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349885997] [2023-08-30 03:00:00,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349885997] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:00:00,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:00:00,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:00:00,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606535208] [2023-08-30 03:00:00,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:00:00,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 03:00:00,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:00:00,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 03:00:00,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 03:00:00,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 257 [2023-08-30 03:00:00,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 85 transitions, 1068 flow. Second operand has 7 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:00,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:00:00,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 257 [2023-08-30 03:00:00,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:00:02,064 INFO L130 PetriNetUnfolder]: 9492/13960 cut-off events. [2023-08-30 03:00:02,065 INFO L131 PetriNetUnfolder]: For 105487/106905 co-relation queries the response was YES. [2023-08-30 03:00:02,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72451 conditions, 13960 events. 9492/13960 cut-off events. For 105487/106905 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 84831 event pairs, 1702 based on Foata normal form. 870/14651 useless extension candidates. Maximal degree in co-relation 72426. Up to 8988 conditions per place. [2023-08-30 03:00:02,164 INFO L137 encePairwiseOnDemand]: 249/257 looper letters, 81 selfloop transitions, 31 changer transitions 23/150 dead transitions. [2023-08-30 03:00:02,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 150 transitions, 1985 flow [2023-08-30 03:00:02,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:00:02,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:00:02,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 873 transitions. [2023-08-30 03:00:02,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48526959421901056 [2023-08-30 03:00:02,180 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 873 transitions. [2023-08-30 03:00:02,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 873 transitions. [2023-08-30 03:00:02,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:00:02,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 873 transitions. [2023-08-30 03:00:02,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.71428571428571) internal successors, (873), 7 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:02,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:02,187 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:02,187 INFO L175 Difference]: Start difference. First operand has 76 places, 85 transitions, 1068 flow. Second operand 7 states and 873 transitions. [2023-08-30 03:00:02,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 150 transitions, 1985 flow [2023-08-30 03:00:02,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 150 transitions, 1909 flow, removed 16 selfloop flow, removed 4 redundant places. [2023-08-30 03:00:02,382 INFO L231 Difference]: Finished difference. Result has 80 places, 91 transitions, 1201 flow [2023-08-30 03:00:02,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=992, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1201, PETRI_PLACES=80, PETRI_TRANSITIONS=91} [2023-08-30 03:00:02,382 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 29 predicate places. [2023-08-30 03:00:02,383 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 91 transitions, 1201 flow [2023-08-30 03:00:02,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:02,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:00:02,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:00:02,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 03:00:02,384 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 03:00:02,384 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:00:02,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1448185346, now seen corresponding path program 3 times [2023-08-30 03:00:02,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:00:02,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232982872] [2023-08-30 03:00:02,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:00:02,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:00:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:00:02,856 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-30 03:00:02,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:00:02,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232982872] [2023-08-30 03:00:02,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232982872] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:00:02,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:00:02,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:00:02,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581599866] [2023-08-30 03:00:02,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:00:02,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 03:00:02,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:00:02,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 03:00:02,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-30 03:00:02,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 257 [2023-08-30 03:00:02,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 91 transitions, 1201 flow. Second operand has 7 states, 7 states have (on average 118.28571428571429) internal successors, (828), 7 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:02,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:00:02,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 257 [2023-08-30 03:00:02,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:00:04,893 INFO L130 PetriNetUnfolder]: 10793/15875 cut-off events. [2023-08-30 03:00:04,893 INFO L131 PetriNetUnfolder]: For 155679/157431 co-relation queries the response was YES. [2023-08-30 03:00:04,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87423 conditions, 15875 events. 10793/15875 cut-off events. For 155679/157431 co-relation queries the response was YES. Maximal size of possible extension queue 786. Compared 99399 event pairs, 1365 based on Foata normal form. 1029/16672 useless extension candidates. Maximal degree in co-relation 87396. Up to 9360 conditions per place. [2023-08-30 03:00:05,029 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 94 selfloop transitions, 31 changer transitions 24/164 dead transitions. [2023-08-30 03:00:05,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 164 transitions, 2324 flow [2023-08-30 03:00:05,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:00:05,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:00:05,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 881 transitions. [2023-08-30 03:00:05,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48971650917176207 [2023-08-30 03:00:05,034 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 881 transitions. [2023-08-30 03:00:05,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 881 transitions. [2023-08-30 03:00:05,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:00:05,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 881 transitions. [2023-08-30 03:00:05,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.85714285714286) internal successors, (881), 7 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:05,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:05,041 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:05,041 INFO L175 Difference]: Start difference. First operand has 80 places, 91 transitions, 1201 flow. Second operand 7 states and 881 transitions. [2023-08-30 03:00:05,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 164 transitions, 2324 flow [2023-08-30 03:00:05,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 164 transitions, 2251 flow, removed 13 selfloop flow, removed 4 redundant places. [2023-08-30 03:00:05,346 INFO L231 Difference]: Finished difference. Result has 83 places, 97 transitions, 1370 flow [2023-08-30 03:00:05,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1370, PETRI_PLACES=83, PETRI_TRANSITIONS=97} [2023-08-30 03:00:05,348 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 32 predicate places. [2023-08-30 03:00:05,349 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 97 transitions, 1370 flow [2023-08-30 03:00:05,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 118.28571428571429) internal successors, (828), 7 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:05,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:00:05,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:00:05,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 03:00:05,350 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 03:00:05,351 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:00:05,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1385999036, now seen corresponding path program 4 times [2023-08-30 03:00:05,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:00:05,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145708803] [2023-08-30 03:00:05,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:00:05,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:00:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:00:05,750 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-30 03:00:05,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:00:05,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145708803] [2023-08-30 03:00:05,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145708803] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:00:05,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:00:05,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:00:05,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880843160] [2023-08-30 03:00:05,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:00:05,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:00:05,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:00:05,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:00:05,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:00:05,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 257 [2023-08-30 03:00:05,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 97 transitions, 1370 flow. Second operand has 6 states, 6 states have (on average 118.66666666666667) internal successors, (712), 6 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:05,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:00:05,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 257 [2023-08-30 03:00:05,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:00:07,830 INFO L130 PetriNetUnfolder]: 11390/16674 cut-off events. [2023-08-30 03:00:07,831 INFO L131 PetriNetUnfolder]: For 217655/219629 co-relation queries the response was YES. [2023-08-30 03:00:07,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98607 conditions, 16674 events. 11390/16674 cut-off events. For 217655/219629 co-relation queries the response was YES. Maximal size of possible extension queue 853. Compared 104924 event pairs, 1940 based on Foata normal form. 1084/17563 useless extension candidates. Maximal degree in co-relation 98578. Up to 10443 conditions per place. [2023-08-30 03:00:07,934 INFO L137 encePairwiseOnDemand]: 249/257 looper letters, 90 selfloop transitions, 39 changer transitions 13/157 dead transitions. [2023-08-30 03:00:07,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 157 transitions, 2375 flow [2023-08-30 03:00:07,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:00:07,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:00:07,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 875 transitions. [2023-08-30 03:00:07,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48638132295719844 [2023-08-30 03:00:07,937 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 875 transitions. [2023-08-30 03:00:07,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 875 transitions. [2023-08-30 03:00:07,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:00:07,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 875 transitions. [2023-08-30 03:00:07,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:07,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:07,943 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:07,943 INFO L175 Difference]: Start difference. First operand has 83 places, 97 transitions, 1370 flow. Second operand 7 states and 875 transitions. [2023-08-30 03:00:07,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 157 transitions, 2375 flow [2023-08-30 03:00:08,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 157 transitions, 2183 flow, removed 77 selfloop flow, removed 6 redundant places. [2023-08-30 03:00:08,410 INFO L231 Difference]: Finished difference. Result has 83 places, 106 transitions, 1551 flow [2023-08-30 03:00:08,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=1264, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1551, PETRI_PLACES=83, PETRI_TRANSITIONS=106} [2023-08-30 03:00:08,411 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 32 predicate places. [2023-08-30 03:00:08,411 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 106 transitions, 1551 flow [2023-08-30 03:00:08,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.66666666666667) internal successors, (712), 6 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:08,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:00:08,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:00:08,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 03:00:08,412 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 03:00:08,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:00:08,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1404940346, now seen corresponding path program 5 times [2023-08-30 03:00:08,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:00:08,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567644192] [2023-08-30 03:00:08,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:00:08,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:00:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:00:09,285 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-30 03:00:09,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:00:09,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567644192] [2023-08-30 03:00:09,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567644192] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:00:09,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:00:09,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:00:09,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650771196] [2023-08-30 03:00:09,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:00:09,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 03:00:09,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:00:09,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 03:00:09,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 03:00:09,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-30 03:00:09,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 106 transitions, 1551 flow. Second operand has 7 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:09,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:00:09,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-30 03:00:09,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:00:11,642 INFO L130 PetriNetUnfolder]: 14631/20590 cut-off events. [2023-08-30 03:00:11,642 INFO L131 PetriNetUnfolder]: For 172297/172297 co-relation queries the response was YES. [2023-08-30 03:00:11,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111735 conditions, 20590 events. 14631/20590 cut-off events. For 172297/172297 co-relation queries the response was YES. Maximal size of possible extension queue 830. Compared 115815 event pairs, 991 based on Foata normal form. 424/21014 useless extension candidates. Maximal degree in co-relation 111707. Up to 7657 conditions per place. [2023-08-30 03:00:11,769 INFO L137 encePairwiseOnDemand]: 244/257 looper letters, 105 selfloop transitions, 102 changer transitions 72/279 dead transitions. [2023-08-30 03:00:11,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 279 transitions, 3942 flow [2023-08-30 03:00:11,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 03:00:11,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 03:00:11,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1299 transitions. [2023-08-30 03:00:11,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4594977007428369 [2023-08-30 03:00:11,773 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1299 transitions. [2023-08-30 03:00:11,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1299 transitions. [2023-08-30 03:00:11,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:00:11,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1299 transitions. [2023-08-30 03:00:11,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 118.0909090909091) internal successors, (1299), 11 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:11,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 257.0) internal successors, (3084), 12 states have internal predecessors, (3084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:11,781 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 257.0) internal successors, (3084), 12 states have internal predecessors, (3084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:11,781 INFO L175 Difference]: Start difference. First operand has 83 places, 106 transitions, 1551 flow. Second operand 11 states and 1299 transitions. [2023-08-30 03:00:11,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 279 transitions, 3942 flow [2023-08-30 03:00:12,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 279 transitions, 3858 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-30 03:00:12,164 INFO L231 Difference]: Finished difference. Result has 93 places, 148 transitions, 2329 flow [2023-08-30 03:00:12,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=1486, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2329, PETRI_PLACES=93, PETRI_TRANSITIONS=148} [2023-08-30 03:00:12,164 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 42 predicate places. [2023-08-30 03:00:12,165 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 148 transitions, 2329 flow [2023-08-30 03:00:12,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:12,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:00:12,165 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:00:12,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 03:00:12,166 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 03:00:12,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:00:12,166 INFO L85 PathProgramCache]: Analyzing trace with hash 843148053, now seen corresponding path program 1 times [2023-08-30 03:00:12,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:00:12,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290550921] [2023-08-30 03:00:12,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:00:12,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:00:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:00:12,748 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-30 03:00:12,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:00:12,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290550921] [2023-08-30 03:00:12,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290550921] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:00:12,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:00:12,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:00:12,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330583638] [2023-08-30 03:00:12,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:00:12,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 03:00:12,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:00:12,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 03:00:12,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 03:00:12,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 257 [2023-08-30 03:00:12,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 148 transitions, 2329 flow. Second operand has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:12,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:00:12,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 257 [2023-08-30 03:00:12,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:00:14,562 INFO L130 PetriNetUnfolder]: 10463/15478 cut-off events. [2023-08-30 03:00:14,563 INFO L131 PetriNetUnfolder]: For 184781/186277 co-relation queries the response was YES. [2023-08-30 03:00:14,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95329 conditions, 15478 events. 10463/15478 cut-off events. For 184781/186277 co-relation queries the response was YES. Maximal size of possible extension queue 867. Compared 97909 event pairs, 2041 based on Foata normal form. 583/15349 useless extension candidates. Maximal degree in co-relation 95297. Up to 10196 conditions per place. [2023-08-30 03:00:14,702 INFO L137 encePairwiseOnDemand]: 249/257 looper letters, 125 selfloop transitions, 23 changer transitions 15/199 dead transitions. [2023-08-30 03:00:14,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 199 transitions, 3151 flow [2023-08-30 03:00:14,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:00:14,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:00:14,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 865 transitions. [2023-08-30 03:00:14,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48082267926625905 [2023-08-30 03:00:14,705 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 865 transitions. [2023-08-30 03:00:14,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 865 transitions. [2023-08-30 03:00:14,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:00:14,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 865 transitions. [2023-08-30 03:00:14,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.57142857142857) internal successors, (865), 7 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:14,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:14,710 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:14,710 INFO L175 Difference]: Start difference. First operand has 93 places, 148 transitions, 2329 flow. Second operand 7 states and 865 transitions. [2023-08-30 03:00:14,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 199 transitions, 3151 flow [2023-08-30 03:00:15,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 199 transitions, 2961 flow, removed 95 selfloop flow, removed 3 redundant places. [2023-08-30 03:00:15,384 INFO L231 Difference]: Finished difference. Result has 96 places, 151 transitions, 2315 flow [2023-08-30 03:00:15,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=2171, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2315, PETRI_PLACES=96, PETRI_TRANSITIONS=151} [2023-08-30 03:00:15,385 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 45 predicate places. [2023-08-30 03:00:15,385 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 151 transitions, 2315 flow [2023-08-30 03:00:15,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:15,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:00:15,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:00:15,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 03:00:15,386 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 03:00:15,386 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:00:15,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1944156795, now seen corresponding path program 2 times [2023-08-30 03:00:15,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:00:15,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390721456] [2023-08-30 03:00:15,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:00:15,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:00:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:00:15,993 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-30 03:00:15,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:00:15,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390721456] [2023-08-30 03:00:15,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390721456] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:00:15,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:00:15,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 03:00:15,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316572707] [2023-08-30 03:00:15,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:00:15,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 03:00:15,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:00:15,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 03:00:15,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-30 03:00:16,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 257 [2023-08-30 03:00:16,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 151 transitions, 2315 flow. Second operand has 8 states, 8 states have (on average 118.125) internal successors, (945), 8 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:16,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:00:16,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 257 [2023-08-30 03:00:16,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:00:18,231 INFO L130 PetriNetUnfolder]: 10668/15803 cut-off events. [2023-08-30 03:00:18,231 INFO L131 PetriNetUnfolder]: For 178893/180515 co-relation queries the response was YES. [2023-08-30 03:00:18,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96042 conditions, 15803 events. 10668/15803 cut-off events. For 178893/180515 co-relation queries the response was YES. Maximal size of possible extension queue 909. Compared 100821 event pairs, 1732 based on Foata normal form. 591/15624 useless extension candidates. Maximal degree in co-relation 96009. Up to 9364 conditions per place. [2023-08-30 03:00:18,371 INFO L137 encePairwiseOnDemand]: 251/257 looper letters, 129 selfloop transitions, 25 changer transitions 17/207 dead transitions. [2023-08-30 03:00:18,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 207 transitions, 3233 flow [2023-08-30 03:00:18,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:00:18,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:00:18,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 878 transitions. [2023-08-30 03:00:18,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48804891606448025 [2023-08-30 03:00:18,375 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 878 transitions. [2023-08-30 03:00:18,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 878 transitions. [2023-08-30 03:00:18,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:00:18,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 878 transitions. [2023-08-30 03:00:18,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.42857142857143) internal successors, (878), 7 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:18,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:18,380 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:18,380 INFO L175 Difference]: Start difference. First operand has 96 places, 151 transitions, 2315 flow. Second operand 7 states and 878 transitions. [2023-08-30 03:00:18,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 207 transitions, 3233 flow [2023-08-30 03:00:18,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 207 transitions, 3155 flow, removed 21 selfloop flow, removed 5 redundant places. [2023-08-30 03:00:18,927 INFO L231 Difference]: Finished difference. Result has 98 places, 154 transitions, 2411 flow [2023-08-30 03:00:18,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=2249, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2411, PETRI_PLACES=98, PETRI_TRANSITIONS=154} [2023-08-30 03:00:18,927 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 47 predicate places. [2023-08-30 03:00:18,928 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 154 transitions, 2411 flow [2023-08-30 03:00:18,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 118.125) internal successors, (945), 8 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:18,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:00:18,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:00:18,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 03:00:18,929 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 03:00:18,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:00:18,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1562206981, now seen corresponding path program 1 times [2023-08-30 03:00:18,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:00:18,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123348048] [2023-08-30 03:00:18,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:00:18,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:00:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:00:19,171 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-30 03:00:19,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:00:19,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123348048] [2023-08-30 03:00:19,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123348048] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:00:19,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:00:19,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:00:19,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883612316] [2023-08-30 03:00:19,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:00:19,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:00:19,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:00:19,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:00:19,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:00:19,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 257 [2023-08-30 03:00:19,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 154 transitions, 2411 flow. Second operand has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:19,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:00:19,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 257 [2023-08-30 03:00:19,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:00:20,221 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([458] L3-->L852: Formula: (let ((.cse1 (not (= (mod v_~z$w_buff0_used~0_131 256) 0))) (.cse2 (not (= (mod v_~z$r_buff1_thd0~0_72 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_70 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_132 256) 0)) .cse5)) (.cse3 (and .cse2 (not (= (mod v_~z$w_buff1_used~0_111 256) 0)))) (.cse4 (and .cse5 .cse1))) (and (= v_~z$w_buff0_used~0_131 (ite .cse0 0 v_~z$w_buff0_used~0_132)) (= (ite (or (and (not (= 0 (mod v_~z$r_buff0_thd0~0_69 256))) .cse1) (and (not (= (mod v_~z$w_buff1_used~0_110 256) 0)) .cse2)) 0 v_~z$r_buff1_thd0~0_72) v_~z$r_buff1_thd0~0_71) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) (= v_~z$w_buff1_used~0_110 (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_111)) (= (ite .cse0 v_~z$w_buff0~0_72 (ite .cse3 v_~z$w_buff1~0_55 v_~z~0_78)) v_~z~0_77) (= v_~z$r_buff0_thd0~0_69 (ite .cse4 0 v_~z$r_buff0_thd0~0_70))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_70, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_132, ~z$w_buff0~0=v_~z$w_buff0~0_72, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_72, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_111, ~z$w_buff1~0=v_~z$w_buff1~0_55, ~z~0=v_~z~0_78} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_69, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_131, ~z$w_buff0~0=v_~z$w_buff0~0_72, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_71, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_110, ~z$w_buff1~0=v_~z$w_buff1~0_55, ~z~0=v_~z~0_77} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0][230], [338#true, Black: 313#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0_used~0 1) (not (= ~z$w_buff1~0 2)) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0)), 18#L852true, Black: 184#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 257#(and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z~0 0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= ~z$w_buff0~0 ~z~0))) (= ~z$w_buff1~0 0) (or (= ~z$w_buff0~0 2) (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (= ~z$w_buff0~0 0) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))))) (= ~z$r_buff0_thd0~0 0)), 104#P0EXITtrue, Black: 329#(and (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0))), Black: 201#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), P1Thread1of1ForFork3InUse, Black: 205#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 266#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork0InUse, Black: 200#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 270#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), Black: 199#(= ~y~0 1), P2Thread1of1ForFork2InUse, 181#true, P0Thread1of1ForFork1InUse, 165#true, 98#L780true, Black: 215#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 218#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 347#(and (= ~z~0 1) (<= 0 ~z$w_buff1_used~0) (= ~z$r_buff0_thd3~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (<= ~z$w_buff1_used~0 0)), Black: 345#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 280#(and (< 0 (+ (div ~z$w_buff1_used~0 256) 1)) (= ~z~0 1) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= ~z$r_buff0_thd0~0 0)), Black: 343#(and (= ~z~0 1) (<= 0 ~z$w_buff1_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (<= ~z$w_buff1_used~0 0)), 352#true, 151#true, 36#L810true, Black: 230#(and (= ~z~0 1) (= ~z$w_buff0_used~0 0)), 197#true, Black: 292#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), Black: 169#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 168#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 173#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 167#(= ~y~0 0), 291#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), 11#L762true, Black: 244#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0)), 163#(and (not (= |ULTIMATE.start_main_~#t1520~0#1.base| |ULTIMATE.start_main_~#t1519~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1519~0#1.base| |ULTIMATE.start_main_~#t1517~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1517~0#1.base| 0) |ULTIMATE.start_main_~#t1519~0#1.base| 0) |ULTIMATE.start_main_~#t1520~0#1.base| 0) |ULTIMATE.start_main_~#t1518~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1518~0#1.base| |ULTIMATE.start_main_~#t1517~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1520~0#1.base| |ULTIMATE.start_main_~#t1517~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1519~0#1.base| |ULTIMATE.start_main_~#t1518~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1520~0#1.base| |ULTIMATE.start_main_~#t1518~0#1.base|))), 307#(and (= ~z$w_buff0_used~0 1) (not (= ~z$w_buff1~0 2)) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0))), Black: 183#(= ~x~0 0), Black: 308#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))))]) [2023-08-30 03:00:20,226 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-30 03:00:20,226 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 03:00:20,226 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 03:00:20,226 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 03:00:20,227 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([399] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][170], [30#L817true, 338#true, Black: 313#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0_used~0 1) (not (= ~z$w_buff1~0 2)) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0)), Black: 307#(and (= ~z$w_buff0_used~0 1) (not (= ~z$w_buff1~0 2)) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0))), Black: 184#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 257#(and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z~0 0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= ~z$w_buff0~0 ~z~0))) (= ~z$w_buff1~0 0) (or (= ~z$w_buff0~0 2) (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (= ~z$w_buff0~0 0) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))))) (= ~z$r_buff0_thd0~0 0)), 104#P0EXITtrue, Black: 329#(and (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0))), Black: 201#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), P1Thread1of1ForFork3InUse, Black: 205#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 266#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork0InUse, Black: 200#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 270#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), Black: 199#(= ~y~0 1), P2Thread1of1ForFork2InUse, 181#true, P0Thread1of1ForFork1InUse, 165#true, 98#L780true, Black: 215#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 218#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 347#(and (= ~z~0 1) (<= 0 ~z$w_buff1_used~0) (= ~z$r_buff0_thd3~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (<= ~z$w_buff1_used~0 0)), Black: 345#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 280#(and (< 0 (+ (div ~z$w_buff1_used~0 256) 1)) (= ~z~0 1) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= ~z$r_buff0_thd0~0 0)), Black: 343#(and (= ~z~0 1) (<= 0 ~z$w_buff1_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (<= ~z$w_buff1_used~0 0)), 352#true, 151#true, Black: 292#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), Black: 230#(and (= ~z~0 1) (= ~z$w_buff0_used~0 0)), 197#true, Black: 169#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 168#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 173#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 74#L3true, Black: 167#(= ~y~0 0), 291#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), 303#true, 11#L762true, Black: 244#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0)), 163#(and (not (= |ULTIMATE.start_main_~#t1520~0#1.base| |ULTIMATE.start_main_~#t1519~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1519~0#1.base| |ULTIMATE.start_main_~#t1517~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1517~0#1.base| 0) |ULTIMATE.start_main_~#t1519~0#1.base| 0) |ULTIMATE.start_main_~#t1520~0#1.base| 0) |ULTIMATE.start_main_~#t1518~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1518~0#1.base| |ULTIMATE.start_main_~#t1517~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1520~0#1.base| |ULTIMATE.start_main_~#t1517~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1519~0#1.base| |ULTIMATE.start_main_~#t1518~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1520~0#1.base| |ULTIMATE.start_main_~#t1518~0#1.base|))), Black: 183#(= ~x~0 0), Black: 308#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))))]) [2023-08-30 03:00:20,227 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-30 03:00:20,227 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 03:00:20,228 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 03:00:20,228 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 03:00:20,249 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([391] L780-->L787: Formula: (let ((.cse2 (not (= (mod v_~z$r_buff1_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_91 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_92 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_79 256) 0)) .cse2))) (and (= v_~z$r_buff0_thd3~0_25 (ite .cse0 0 v_~z$r_buff0_thd3~0_26)) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_79) v_~z$w_buff1_used~0_78) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_78 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd3~0_25 256) 0)))) 0 v_~z$r_buff1_thd3~0_24) v_~z$r_buff1_thd3~0_23) (= (ite .cse4 0 v_~z$w_buff0_used~0_92) v_~z$w_buff0_used~0_91) (= v_~z~0_49 (ite .cse4 v_~z$w_buff0~0_36 (ite .cse1 v_~z$w_buff1~0_27 v_~z~0_50)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_26, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_50} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_78, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_25, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][235], [338#true, Black: 313#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0_used~0 1) (not (= ~z$w_buff1~0 2)) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0)), Black: 184#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 307#(and (= ~z$w_buff0_used~0 1) (not (= ~z$w_buff1~0 2)) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0))), Black: 257#(and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z~0 0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= ~z$w_buff0~0 ~z~0))) (= ~z$w_buff1~0 0) (or (= ~z$w_buff0~0 2) (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (= ~z$w_buff0~0 0) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))))) (= ~z$r_buff0_thd0~0 0)), 104#P0EXITtrue, Black: 329#(and (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0))), Black: 201#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), P1Thread1of1ForFork3InUse, Black: 205#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 266#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), Black: 200#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), P3Thread1of1ForFork0InUse, Black: 270#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), Black: 199#(= ~y~0 1), P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 181#true, 165#true, Black: 215#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 218#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 347#(and (= ~z~0 1) (<= 0 ~z$w_buff1_used~0) (= ~z$r_buff0_thd3~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (<= ~z$w_buff1_used~0 0)), Black: 345#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 280#(and (< 0 (+ (div ~z$w_buff1_used~0 256) 1)) (= ~z~0 1) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= ~z$r_buff0_thd0~0 0)), Black: 343#(and (= ~z~0 1) (<= 0 ~z$w_buff1_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (<= ~z$w_buff1_used~0 0)), 151#true, 36#L810true, 117#L787true, Black: 230#(and (= ~z~0 1) (= ~z$w_buff0_used~0 0)), 197#true, Black: 292#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), Black: 169#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 168#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 173#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 167#(= ~y~0 0), 74#L3true, 291#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), 303#true, 11#L762true, Black: 244#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0)), 163#(and (not (= |ULTIMATE.start_main_~#t1520~0#1.base| |ULTIMATE.start_main_~#t1519~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1519~0#1.base| |ULTIMATE.start_main_~#t1517~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1517~0#1.base| 0) |ULTIMATE.start_main_~#t1519~0#1.base| 0) |ULTIMATE.start_main_~#t1520~0#1.base| 0) |ULTIMATE.start_main_~#t1518~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1518~0#1.base| |ULTIMATE.start_main_~#t1517~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1520~0#1.base| |ULTIMATE.start_main_~#t1517~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1519~0#1.base| |ULTIMATE.start_main_~#t1518~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1520~0#1.base| |ULTIMATE.start_main_~#t1518~0#1.base|))), Black: 308#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 183#(= ~x~0 0), 355#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)]) [2023-08-30 03:00:20,249 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-30 03:00:20,250 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 03:00:20,250 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 03:00:20,250 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 03:00:20,251 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([399] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][236], [30#L817true, 338#true, Black: 313#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0_used~0 1) (not (= ~z$w_buff1~0 2)) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0)), Black: 307#(and (= ~z$w_buff0_used~0 1) (not (= ~z$w_buff1~0 2)) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0))), Black: 184#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 257#(and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z~0 0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= ~z$w_buff0~0 ~z~0))) (= ~z$w_buff1~0 0) (or (= ~z$w_buff0~0 2) (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (= ~z$w_buff0~0 0) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))))) (= ~z$r_buff0_thd0~0 0)), 104#P0EXITtrue, Black: 329#(and (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0))), Black: 201#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), P1Thread1of1ForFork3InUse, Black: 205#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 266#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), Black: 200#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), P3Thread1of1ForFork0InUse, Black: 270#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), Black: 199#(= ~y~0 1), P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 181#true, 165#true, 98#L780true, Black: 215#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 218#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 347#(and (= ~z~0 1) (<= 0 ~z$w_buff1_used~0) (= ~z$r_buff0_thd3~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (<= ~z$w_buff1_used~0 0)), Black: 345#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 280#(and (< 0 (+ (div ~z$w_buff1_used~0 256) 1)) (= ~z~0 1) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= ~z$r_buff0_thd0~0 0)), Black: 343#(and (= ~z~0 1) (<= 0 ~z$w_buff1_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (<= ~z$w_buff1_used~0 0)), 151#true, Black: 230#(and (= ~z~0 1) (= ~z$w_buff0_used~0 0)), 197#true, Black: 292#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), Black: 169#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 168#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 173#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 167#(= ~y~0 0), 74#L3true, 291#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), 303#true, 11#L762true, Black: 244#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0)), 163#(and (not (= |ULTIMATE.start_main_~#t1520~0#1.base| |ULTIMATE.start_main_~#t1519~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1519~0#1.base| |ULTIMATE.start_main_~#t1517~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1517~0#1.base| 0) |ULTIMATE.start_main_~#t1519~0#1.base| 0) |ULTIMATE.start_main_~#t1520~0#1.base| 0) |ULTIMATE.start_main_~#t1518~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1518~0#1.base| |ULTIMATE.start_main_~#t1517~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1520~0#1.base| |ULTIMATE.start_main_~#t1517~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1519~0#1.base| |ULTIMATE.start_main_~#t1518~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1520~0#1.base| |ULTIMATE.start_main_~#t1518~0#1.base|))), Black: 308#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 183#(= ~x~0 0), 355#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)]) [2023-08-30 03:00:20,251 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-30 03:00:20,251 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 03:00:20,251 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 03:00:20,251 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 03:00:20,330 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([391] L780-->L787: Formula: (let ((.cse2 (not (= (mod v_~z$r_buff1_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_91 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_92 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_79 256) 0)) .cse2))) (and (= v_~z$r_buff0_thd3~0_25 (ite .cse0 0 v_~z$r_buff0_thd3~0_26)) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_79) v_~z$w_buff1_used~0_78) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_78 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd3~0_25 256) 0)))) 0 v_~z$r_buff1_thd3~0_24) v_~z$r_buff1_thd3~0_23) (= (ite .cse4 0 v_~z$w_buff0_used~0_92) v_~z$w_buff0_used~0_91) (= v_~z~0_49 (ite .cse4 v_~z$w_buff0~0_36 (ite .cse1 v_~z$w_buff1~0_27 v_~z~0_50)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_26, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_50} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_78, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_25, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][169], [338#true, Black: 313#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0_used~0 1) (not (= ~z$w_buff1~0 2)) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0)), Black: 184#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 307#(and (= ~z$w_buff0_used~0 1) (not (= ~z$w_buff1~0 2)) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0))), Black: 257#(and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z~0 0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= ~z$w_buff0~0 ~z~0))) (= ~z$w_buff1~0 0) (or (= ~z$w_buff0~0 2) (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (= ~z$w_buff0~0 0) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))))) (= ~z$r_buff0_thd0~0 0)), 104#P0EXITtrue, Black: 329#(and (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0))), Black: 201#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), P1Thread1of1ForFork3InUse, Black: 205#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 266#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork0InUse, Black: 200#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 270#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), Black: 199#(= ~y~0 1), P2Thread1of1ForFork2InUse, 181#true, P0Thread1of1ForFork1InUse, 165#true, Black: 215#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 218#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 347#(and (= ~z~0 1) (<= 0 ~z$w_buff1_used~0) (= ~z$r_buff0_thd3~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (<= ~z$w_buff1_used~0 0)), Black: 345#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 280#(and (< 0 (+ (div ~z$w_buff1_used~0 256) 1)) (= ~z~0 1) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= ~z$r_buff0_thd0~0 0)), Black: 343#(and (= ~z~0 1) (<= 0 ~z$w_buff1_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (<= ~z$w_buff1_used~0 0)), 352#true, 151#true, 36#L810true, 117#L787true, Black: 230#(and (= ~z~0 1) (= ~z$w_buff0_used~0 0)), 197#true, Black: 292#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), Black: 169#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 168#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 173#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 74#L3true, Black: 167#(= ~y~0 0), 291#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), 303#true, 11#L762true, Black: 244#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0)), 163#(and (not (= |ULTIMATE.start_main_~#t1520~0#1.base| |ULTIMATE.start_main_~#t1519~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1519~0#1.base| |ULTIMATE.start_main_~#t1517~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1517~0#1.base| 0) |ULTIMATE.start_main_~#t1519~0#1.base| 0) |ULTIMATE.start_main_~#t1520~0#1.base| 0) |ULTIMATE.start_main_~#t1518~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1518~0#1.base| |ULTIMATE.start_main_~#t1517~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1520~0#1.base| |ULTIMATE.start_main_~#t1517~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1519~0#1.base| |ULTIMATE.start_main_~#t1518~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1520~0#1.base| |ULTIMATE.start_main_~#t1518~0#1.base|))), Black: 308#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 183#(= ~x~0 0)]) [2023-08-30 03:00:20,331 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is not cut-off event [2023-08-30 03:00:20,331 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2023-08-30 03:00:20,331 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2023-08-30 03:00:20,331 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2023-08-30 03:00:21,044 INFO L130 PetriNetUnfolder]: 8336/12540 cut-off events. [2023-08-30 03:00:21,044 INFO L131 PetriNetUnfolder]: For 212178/216316 co-relation queries the response was YES. [2023-08-30 03:00:21,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78726 conditions, 12540 events. 8336/12540 cut-off events. For 212178/216316 co-relation queries the response was YES. Maximal size of possible extension queue 947. Compared 83685 event pairs, 1502 based on Foata normal form. 2601/14686 useless extension candidates. Maximal degree in co-relation 78692. Up to 8319 conditions per place. [2023-08-30 03:00:21,129 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 264 selfloop transitions, 10 changer transitions 36/349 dead transitions. [2023-08-30 03:00:21,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 349 transitions, 6257 flow [2023-08-30 03:00:21,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:00:21,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:00:21,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 636 transitions. [2023-08-30 03:00:21,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49494163424124515 [2023-08-30 03:00:21,131 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 636 transitions. [2023-08-30 03:00:21,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 636 transitions. [2023-08-30 03:00:21,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:00:21,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 636 transitions. [2023-08-30 03:00:21,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:21,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:21,134 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:21,135 INFO L175 Difference]: Start difference. First operand has 98 places, 154 transitions, 2411 flow. Second operand 5 states and 636 transitions. [2023-08-30 03:00:21,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 349 transitions, 6257 flow [2023-08-30 03:00:21,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 349 transitions, 6109 flow, removed 37 selfloop flow, removed 4 redundant places. [2023-08-30 03:00:21,377 INFO L231 Difference]: Finished difference. Result has 99 places, 160 transitions, 2437 flow [2023-08-30 03:00:21,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=2320, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2437, PETRI_PLACES=99, PETRI_TRANSITIONS=160} [2023-08-30 03:00:21,378 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 48 predicate places. [2023-08-30 03:00:21,378 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 160 transitions, 2437 flow [2023-08-30 03:00:21,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:21,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:00:21,379 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-30 03:00:21,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 03:00:21,381 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 03:00:21,381 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:00:21,381 INFO L85 PathProgramCache]: Analyzing trace with hash 904814390, now seen corresponding path program 1 times [2023-08-30 03:00:21,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:00:21,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968514184] [2023-08-30 03:00:21,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:00:21,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:00:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:00:21,945 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-30 03:00:21,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:00:21,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968514184] [2023-08-30 03:00:21,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968514184] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:00:21,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:00:21,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 03:00:21,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629357273] [2023-08-30 03:00:21,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:00:21,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 03:00:21,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:00:21,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 03:00:21,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 03:00:21,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 257 [2023-08-30 03:00:21,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 160 transitions, 2437 flow. Second operand has 8 states, 8 states have (on average 118.25) internal successors, (946), 8 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:21,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:00:21,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 257 [2023-08-30 03:00:21,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:00:23,781 INFO L130 PetriNetUnfolder]: 10072/15790 cut-off events. [2023-08-30 03:00:23,781 INFO L131 PetriNetUnfolder]: For 178892/181334 co-relation queries the response was YES. [2023-08-30 03:00:23,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102471 conditions, 15790 events. 10072/15790 cut-off events. For 178892/181334 co-relation queries the response was YES. Maximal size of possible extension queue 988. Compared 111544 event pairs, 1380 based on Foata normal form. 762/16220 useless extension candidates. Maximal degree in co-relation 102436. Up to 7065 conditions per place. [2023-08-30 03:00:23,959 INFO L137 encePairwiseOnDemand]: 251/257 looper letters, 121 selfloop transitions, 36 changer transitions 32/224 dead transitions. [2023-08-30 03:00:23,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 224 transitions, 3464 flow [2023-08-30 03:00:23,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:00:23,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:00:23,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 874 transitions. [2023-08-30 03:00:23,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4858254585881045 [2023-08-30 03:00:23,962 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 874 transitions. [2023-08-30 03:00:23,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 874 transitions. [2023-08-30 03:00:23,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:00:23,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 874 transitions. [2023-08-30 03:00:23,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 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-30 03:00:23,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:23,966 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:23,966 INFO L175 Difference]: Start difference. First operand has 99 places, 160 transitions, 2437 flow. Second operand 7 states and 874 transitions. [2023-08-30 03:00:23,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 224 transitions, 3464 flow [2023-08-30 03:00:24,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 224 transitions, 3420 flow, removed 16 selfloop flow, removed 1 redundant places. [2023-08-30 03:00:24,578 INFO L231 Difference]: Finished difference. Result has 107 places, 157 transitions, 2492 flow [2023-08-30 03:00:24,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=2414, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2492, PETRI_PLACES=107, PETRI_TRANSITIONS=157} [2023-08-30 03:00:24,578 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 56 predicate places. [2023-08-30 03:00:24,579 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 157 transitions, 2492 flow [2023-08-30 03:00:24,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 118.25) internal successors, (946), 8 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:24,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:00:24,579 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-30 03:00:24,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 03:00:24,579 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 03:00:24,580 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:00:24,580 INFO L85 PathProgramCache]: Analyzing trace with hash -339434168, now seen corresponding path program 1 times [2023-08-30 03:00:24,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:00:24,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056744487] [2023-08-30 03:00:24,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:00:24,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:00:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:00:24,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:00:24,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:00:24,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056744487] [2023-08-30 03:00:24,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056744487] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:00:24,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:00:24,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:00:24,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075970060] [2023-08-30 03:00:24,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:00:24,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:00:24,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:00:24,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:00:24,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:00:24,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 257 [2023-08-30 03:00:24,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 157 transitions, 2492 flow. Second operand has 5 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:24,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:00:24,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 257 [2023-08-30 03:00:24,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:00:25,732 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([391] L780-->L787: Formula: (let ((.cse2 (not (= (mod v_~z$r_buff1_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_91 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_92 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_79 256) 0)) .cse2))) (and (= v_~z$r_buff0_thd3~0_25 (ite .cse0 0 v_~z$r_buff0_thd3~0_26)) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_79) v_~z$w_buff1_used~0_78) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_78 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd3~0_25 256) 0)))) 0 v_~z$r_buff1_thd3~0_24) v_~z$r_buff1_thd3~0_23) (= (ite .cse4 0 v_~z$w_buff0_used~0_92) v_~z$w_buff0_used~0_91) (= v_~z~0_49 (ite .cse4 v_~z$w_buff0~0_36 (ite .cse1 v_~z$w_buff1~0_27 v_~z~0_50)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_26, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_50} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_78, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_25, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][232], [Black: 313#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0_used~0 1) (not (= ~z$w_buff1~0 2)) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0)), Black: 184#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 307#(and (= ~z$w_buff0_used~0 1) (not (= ~z$w_buff1~0 2)) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0))), Black: 257#(and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z~0 0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= ~z$w_buff0~0 ~z~0))) (= ~z$w_buff1~0 0) (or (= ~z$w_buff0~0 2) (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (= ~z$w_buff0~0 0) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))))) (= ~z$r_buff0_thd0~0 0)), 104#P0EXITtrue, 366#(and (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), Black: 329#(and (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0))), Black: 201#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), P1Thread1of1ForFork3InUse, Black: 205#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 266#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), Black: 200#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), P3Thread1of1ForFork0InUse, Black: 270#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), Black: 199#(= ~y~0 1), P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 181#true, 165#true, Black: 215#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 218#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 280#(and (< 0 (+ (div ~z$w_buff1_used~0 256) 1)) (= ~z~0 1) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= ~z$r_buff0_thd0~0 0)), Black: 343#(and (= ~z~0 1) (<= 0 ~z$w_buff1_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (<= ~z$w_buff1_used~0 0)), Black: 354#(= ~__unbuffered_cnt~0 0), Black: 357#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 355#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 151#true, 36#L810true, 117#L787true, Black: 230#(and (= ~z~0 1) (= ~z$w_buff0_used~0 0)), 197#true, Black: 292#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), Black: 169#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 168#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 173#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 74#L3true, Black: 167#(= ~y~0 0), 291#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), 303#true, Black: 373#(and (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), 11#L762true, Black: 244#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0)), Black: 375#(and (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 163#(and (not (= |ULTIMATE.start_main_~#t1520~0#1.base| |ULTIMATE.start_main_~#t1519~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1519~0#1.base| |ULTIMATE.start_main_~#t1517~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1517~0#1.base| 0) |ULTIMATE.start_main_~#t1519~0#1.base| 0) |ULTIMATE.start_main_~#t1520~0#1.base| 0) |ULTIMATE.start_main_~#t1518~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1518~0#1.base| |ULTIMATE.start_main_~#t1517~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1520~0#1.base| |ULTIMATE.start_main_~#t1517~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1519~0#1.base| |ULTIMATE.start_main_~#t1518~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1520~0#1.base| |ULTIMATE.start_main_~#t1518~0#1.base|))), Black: 308#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 183#(= ~x~0 0), 388#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))]) [2023-08-30 03:00:25,733 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-30 03:00:25,733 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 03:00:25,733 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 03:00:25,733 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 03:00:25,733 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([399] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][233], [30#L817true, Black: 313#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0_used~0 1) (not (= ~z$w_buff1~0 2)) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0)), Black: 307#(and (= ~z$w_buff0_used~0 1) (not (= ~z$w_buff1~0 2)) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0))), Black: 184#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 257#(and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z~0 0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= ~z$w_buff0~0 ~z~0))) (= ~z$w_buff1~0 0) (or (= ~z$w_buff0~0 2) (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (= ~z$w_buff0~0 0) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))))) (= ~z$r_buff0_thd0~0 0)), 104#P0EXITtrue, Black: 329#(and (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0))), Black: 201#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), P1Thread1of1ForFork3InUse, Black: 205#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 266#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), Black: 200#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), 365#(and (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork0InUse, Black: 270#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), Black: 199#(= ~y~0 1), P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 181#true, 165#true, 98#L780true, Black: 215#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 218#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 280#(and (< 0 (+ (div ~z$w_buff1_used~0 256) 1)) (= ~z~0 1) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= ~z$r_buff0_thd0~0 0)), Black: 343#(and (= ~z~0 1) (<= 0 ~z$w_buff1_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (<= ~z$w_buff1_used~0 0)), Black: 354#(= ~__unbuffered_cnt~0 0), Black: 357#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 355#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 151#true, Black: 230#(and (= ~z~0 1) (= ~z$w_buff0_used~0 0)), 197#true, Black: 292#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), Black: 169#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 168#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 173#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 74#L3true, Black: 167#(= ~y~0 0), 291#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), 303#true, Black: 366#(and (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), Black: 373#(and (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), 11#L762true, Black: 244#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0)), Black: 375#(and (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 163#(and (not (= |ULTIMATE.start_main_~#t1520~0#1.base| |ULTIMATE.start_main_~#t1519~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1519~0#1.base| |ULTIMATE.start_main_~#t1517~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1517~0#1.base| 0) |ULTIMATE.start_main_~#t1519~0#1.base| 0) |ULTIMATE.start_main_~#t1520~0#1.base| 0) |ULTIMATE.start_main_~#t1518~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1518~0#1.base| |ULTIMATE.start_main_~#t1517~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1520~0#1.base| |ULTIMATE.start_main_~#t1517~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1519~0#1.base| |ULTIMATE.start_main_~#t1518~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1520~0#1.base| |ULTIMATE.start_main_~#t1518~0#1.base|))), Black: 308#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 183#(= ~x~0 0), 388#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))]) [2023-08-30 03:00:25,733 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-30 03:00:25,733 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 03:00:25,733 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 03:00:25,734 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 03:00:25,739 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([391] L780-->L787: Formula: (let ((.cse2 (not (= (mod v_~z$r_buff1_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_91 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_92 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_79 256) 0)) .cse2))) (and (= v_~z$r_buff0_thd3~0_25 (ite .cse0 0 v_~z$r_buff0_thd3~0_26)) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_79) v_~z$w_buff1_used~0_78) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_78 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd3~0_25 256) 0)))) 0 v_~z$r_buff1_thd3~0_24) v_~z$r_buff1_thd3~0_23) (= (ite .cse4 0 v_~z$w_buff0_used~0_92) v_~z$w_buff0_used~0_91) (= v_~z~0_49 (ite .cse4 v_~z$w_buff0~0_36 (ite .cse1 v_~z$w_buff1~0_27 v_~z~0_50)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_26, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_50} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_78, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_25, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][232], [Black: 313#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0_used~0 1) (not (= ~z$w_buff1~0 2)) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0)), Black: 184#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 307#(and (= ~z$w_buff0_used~0 1) (not (= ~z$w_buff1~0 2)) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0))), Black: 257#(and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z~0 0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= ~z$w_buff0~0 ~z~0))) (= ~z$w_buff1~0 0) (or (= ~z$w_buff0~0 2) (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (= ~z$w_buff0~0 0) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))))) (= ~z$r_buff0_thd0~0 0)), 104#P0EXITtrue, 366#(and (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), Black: 329#(and (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0))), Black: 201#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), P1Thread1of1ForFork3InUse, Black: 205#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 266#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), Black: 200#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), P3Thread1of1ForFork0InUse, Black: 270#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), Black: 199#(= ~y~0 1), P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 181#true, 165#true, Black: 215#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 218#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 280#(and (< 0 (+ (div ~z$w_buff1_used~0 256) 1)) (= ~z~0 1) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= ~z$r_buff0_thd0~0 0)), Black: 343#(and (= ~z~0 1) (<= 0 ~z$w_buff1_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (<= ~z$w_buff1_used~0 0)), Black: 354#(= ~__unbuffered_cnt~0 0), Black: 357#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 151#true, 117#L787true, 36#L810true, Black: 230#(and (= ~z~0 1) (= ~z$w_buff0_used~0 0)), 197#true, Black: 292#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), Black: 169#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 168#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 173#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 74#L3true, Black: 167#(= ~y~0 0), 291#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), 303#true, Black: 373#(and (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), 11#L762true, Black: 244#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0)), Black: 375#(and (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 163#(and (not (= |ULTIMATE.start_main_~#t1520~0#1.base| |ULTIMATE.start_main_~#t1519~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1519~0#1.base| |ULTIMATE.start_main_~#t1517~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1517~0#1.base| 0) |ULTIMATE.start_main_~#t1519~0#1.base| 0) |ULTIMATE.start_main_~#t1520~0#1.base| 0) |ULTIMATE.start_main_~#t1518~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1518~0#1.base| |ULTIMATE.start_main_~#t1517~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1520~0#1.base| |ULTIMATE.start_main_~#t1517~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1519~0#1.base| |ULTIMATE.start_main_~#t1518~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1520~0#1.base| |ULTIMATE.start_main_~#t1518~0#1.base|))), Black: 308#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), 388#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 183#(= ~x~0 0), 355#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)]) [2023-08-30 03:00:25,739 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-30 03:00:25,739 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 03:00:25,739 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 03:00:25,739 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 03:00:25,740 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([399] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][233], [30#L817true, Black: 313#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0_used~0 1) (not (= ~z$w_buff1~0 2)) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0)), Black: 307#(and (= ~z$w_buff0_used~0 1) (not (= ~z$w_buff1~0 2)) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0))), Black: 184#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 257#(and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z~0 0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= ~z$w_buff0~0 ~z~0))) (= ~z$w_buff1~0 0) (or (= ~z$w_buff0~0 2) (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (= ~z$w_buff0~0 0) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))))) (= ~z$r_buff0_thd0~0 0)), 104#P0EXITtrue, Black: 329#(and (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0))), Black: 201#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), P1Thread1of1ForFork3InUse, Black: 205#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 266#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), Black: 200#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), 365#(and (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork0InUse, Black: 270#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), Black: 199#(= ~y~0 1), P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 181#true, 165#true, 98#L780true, Black: 215#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 218#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 280#(and (< 0 (+ (div ~z$w_buff1_used~0 256) 1)) (= ~z~0 1) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= ~z$r_buff0_thd0~0 0)), Black: 343#(and (= ~z~0 1) (<= 0 ~z$w_buff1_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (<= ~z$w_buff1_used~0 0)), Black: 354#(= ~__unbuffered_cnt~0 0), Black: 357#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 151#true, Black: 230#(and (= ~z~0 1) (= ~z$w_buff0_used~0 0)), 197#true, Black: 292#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), Black: 169#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 168#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 173#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 74#L3true, Black: 167#(= ~y~0 0), 291#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), 303#true, Black: 366#(and (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), Black: 373#(and (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= ~z$r_buff1_thd0~0 0)), 11#L762true, Black: 244#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0)), Black: 375#(and (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 163#(and (not (= |ULTIMATE.start_main_~#t1520~0#1.base| |ULTIMATE.start_main_~#t1519~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1519~0#1.base| |ULTIMATE.start_main_~#t1517~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1517~0#1.base| 0) |ULTIMATE.start_main_~#t1519~0#1.base| 0) |ULTIMATE.start_main_~#t1520~0#1.base| 0) |ULTIMATE.start_main_~#t1518~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1518~0#1.base| |ULTIMATE.start_main_~#t1517~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1520~0#1.base| |ULTIMATE.start_main_~#t1517~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1519~0#1.base| |ULTIMATE.start_main_~#t1518~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1520~0#1.base| |ULTIMATE.start_main_~#t1518~0#1.base|))), Black: 308#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), 388#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 183#(= ~x~0 0), 355#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)]) [2023-08-30 03:00:25,740 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-30 03:00:25,740 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 03:00:25,740 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 03:00:25,740 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 03:00:26,288 INFO L130 PetriNetUnfolder]: 6403/10237 cut-off events. [2023-08-30 03:00:26,288 INFO L131 PetriNetUnfolder]: For 187177/192210 co-relation queries the response was YES. [2023-08-30 03:00:26,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69190 conditions, 10237 events. 6403/10237 cut-off events. For 187177/192210 co-relation queries the response was YES. Maximal size of possible extension queue 784. Compared 73238 event pairs, 468 based on Foata normal form. 3057/13000 useless extension candidates. Maximal degree in co-relation 69152. Up to 4348 conditions per place. [2023-08-30 03:00:26,351 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 318 selfloop transitions, 17 changer transitions 74/447 dead transitions. [2023-08-30 03:00:26,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 447 transitions, 8399 flow [2023-08-30 03:00:26,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:00:26,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:00:26,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 889 transitions. [2023-08-30 03:00:26,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49416342412451364 [2023-08-30 03:00:26,353 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 889 transitions. [2023-08-30 03:00:26,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 889 transitions. [2023-08-30 03:00:26,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:00:26,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 889 transitions. [2023-08-30 03:00:26,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 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-30 03:00:26,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:26,358 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:26,358 INFO L175 Difference]: Start difference. First operand has 107 places, 157 transitions, 2492 flow. Second operand 7 states and 889 transitions. [2023-08-30 03:00:26,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 447 transitions, 8399 flow [2023-08-30 03:00:26,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 447 transitions, 8141 flow, removed 17 selfloop flow, removed 7 redundant places. [2023-08-30 03:00:26,528 INFO L231 Difference]: Finished difference. Result has 107 places, 155 transitions, 2388 flow [2023-08-30 03:00:26,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=2208, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2388, PETRI_PLACES=107, PETRI_TRANSITIONS=155} [2023-08-30 03:00:26,529 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 56 predicate places. [2023-08-30 03:00:26,529 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 155 transitions, 2388 flow [2023-08-30 03:00:26,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:26,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:00:26,530 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-30 03:00:26,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-30 03:00:26,530 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 03:00:26,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:00:26,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1916801375, now seen corresponding path program 1 times [2023-08-30 03:00:26,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:00:26,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826220224] [2023-08-30 03:00:26,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:00:26,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:00:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:00:27,091 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-30 03:00:27,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:00:27,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826220224] [2023-08-30 03:00:27,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826220224] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:00:27,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:00:27,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:00:27,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249446378] [2023-08-30 03:00:27,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:00:27,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:00:27,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:00:27,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:00:27,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:00:27,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 257 [2023-08-30 03:00:27,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 155 transitions, 2388 flow. Second operand has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:27,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:00:27,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 257 [2023-08-30 03:00:27,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:00:29,109 INFO L130 PetriNetUnfolder]: 10460/16775 cut-off events. [2023-08-30 03:00:29,109 INFO L131 PetriNetUnfolder]: For 191378/192130 co-relation queries the response was YES. [2023-08-30 03:00:29,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119817 conditions, 16775 events. 10460/16775 cut-off events. For 191378/192130 co-relation queries the response was YES. Maximal size of possible extension queue 994. Compared 120409 event pairs, 1960 based on Foata normal form. 535/17253 useless extension candidates. Maximal degree in co-relation 119779. Up to 8498 conditions per place. [2023-08-30 03:00:29,213 INFO L137 encePairwiseOnDemand]: 245/257 looper letters, 141 selfloop transitions, 38 changer transitions 99/282 dead transitions. [2023-08-30 03:00:29,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 282 transitions, 4535 flow [2023-08-30 03:00:29,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:00:29,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:00:29,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 842 transitions. [2023-08-30 03:00:29,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4680377987770984 [2023-08-30 03:00:29,215 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 842 transitions. [2023-08-30 03:00:29,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 842 transitions. [2023-08-30 03:00:29,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:00:29,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 842 transitions. [2023-08-30 03:00:29,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.28571428571429) internal successors, (842), 7 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:29,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:29,219 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:29,219 INFO L175 Difference]: Start difference. First operand has 107 places, 155 transitions, 2388 flow. Second operand 7 states and 842 transitions. [2023-08-30 03:00:29,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 282 transitions, 4535 flow [2023-08-30 03:00:30,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 282 transitions, 4393 flow, removed 52 selfloop flow, removed 4 redundant places. [2023-08-30 03:00:30,358 INFO L231 Difference]: Finished difference. Result has 113 places, 130 transitions, 2074 flow [2023-08-30 03:00:30,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=2338, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2074, PETRI_PLACES=113, PETRI_TRANSITIONS=130} [2023-08-30 03:00:30,359 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 62 predicate places. [2023-08-30 03:00:30,359 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 130 transitions, 2074 flow [2023-08-30 03:00:30,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:30,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:00:30,360 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-30 03:00:30,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-30 03:00:30,360 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 03:00:30,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:00:30,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1592463611, now seen corresponding path program 1 times [2023-08-30 03:00:30,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:00:30,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945694643] [2023-08-30 03:00:30,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:00:30,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:00:30,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:00:30,548 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-30 03:00:30,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:00:30,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945694643] [2023-08-30 03:00:30,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945694643] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:00:30,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:00:30,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:00:30,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263492793] [2023-08-30 03:00:30,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:00:30,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:00:30,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:00:30,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:00:30,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:00:30,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 257 [2023-08-30 03:00:30,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 130 transitions, 2074 flow. Second operand has 6 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-30 03:00:30,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:00:30,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 257 [2023-08-30 03:00:30,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:00:31,401 INFO L130 PetriNetUnfolder]: 3334/5732 cut-off events. [2023-08-30 03:00:31,401 INFO L131 PetriNetUnfolder]: For 91601/93807 co-relation queries the response was YES. [2023-08-30 03:00:31,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38624 conditions, 5732 events. 3334/5732 cut-off events. For 91601/93807 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 40638 event pairs, 183 based on Foata normal form. 1478/7057 useless extension candidates. Maximal degree in co-relation 38583. Up to 2147 conditions per place. [2023-08-30 03:00:31,432 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 231 selfloop transitions, 19 changer transitions 149/424 dead transitions. [2023-08-30 03:00:31,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 424 transitions, 7917 flow [2023-08-30 03:00:31,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 03:00:31,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 03:00:31,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1136 transitions. [2023-08-30 03:00:31,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49113705144833547 [2023-08-30 03:00:31,434 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1136 transitions. [2023-08-30 03:00:31,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1136 transitions. [2023-08-30 03:00:31,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:00:31,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1136 transitions. [2023-08-30 03:00:31,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 126.22222222222223) internal successors, (1136), 9 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:31,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 257.0) internal successors, (2570), 10 states have internal predecessors, (2570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:31,438 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 257.0) internal successors, (2570), 10 states have internal predecessors, (2570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:31,438 INFO L175 Difference]: Start difference. First operand has 113 places, 130 transitions, 2074 flow. Second operand 9 states and 1136 transitions. [2023-08-30 03:00:31,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 424 transitions, 7917 flow [2023-08-30 03:00:31,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 424 transitions, 7322 flow, removed 67 selfloop flow, removed 12 redundant places. [2023-08-30 03:00:31,587 INFO L231 Difference]: Finished difference. Result has 107 places, 116 transitions, 1644 flow [2023-08-30 03:00:31,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=1605, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1644, PETRI_PLACES=107, PETRI_TRANSITIONS=116} [2023-08-30 03:00:31,587 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 56 predicate places. [2023-08-30 03:00:31,587 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 116 transitions, 1644 flow [2023-08-30 03:00:31,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 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-30 03:00:31,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:00:31,588 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-30 03:00:31,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-30 03:00:31,588 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 03:00:31,588 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:00:31,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1223019925, now seen corresponding path program 1 times [2023-08-30 03:00:31,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:00:31,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745328309] [2023-08-30 03:00:31,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:00:31,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:00:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:00:31,767 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-30 03:00:31,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:00:31,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745328309] [2023-08-30 03:00:31,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745328309] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:00:31,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:00:31,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:00:31,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474767619] [2023-08-30 03:00:31,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:00:31,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:00:31,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:00:31,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:00:31,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:00:31,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 257 [2023-08-30 03:00:31,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 116 transitions, 1644 flow. Second operand has 5 states, 5 states have (on average 120.2) internal successors, (601), 5 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:31,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:00:31,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 257 [2023-08-30 03:00:31,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:00:32,649 INFO L130 PetriNetUnfolder]: 4409/8085 cut-off events. [2023-08-30 03:00:32,649 INFO L131 PetriNetUnfolder]: For 80268/80987 co-relation queries the response was YES. [2023-08-30 03:00:32,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56450 conditions, 8085 events. 4409/8085 cut-off events. For 80268/80987 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 63955 event pairs, 621 based on Foata normal form. 357/8367 useless extension candidates. Maximal degree in co-relation 56415. Up to 3837 conditions per place. [2023-08-30 03:00:32,688 INFO L137 encePairwiseOnDemand]: 253/257 looper letters, 106 selfloop transitions, 1 changer transitions 116/237 dead transitions. [2023-08-30 03:00:32,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 237 transitions, 3763 flow [2023-08-30 03:00:32,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:00:32,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:00:32,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 639 transitions. [2023-08-30 03:00:32,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4972762645914397 [2023-08-30 03:00:32,690 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 639 transitions. [2023-08-30 03:00:32,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 639 transitions. [2023-08-30 03:00:32,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:00:32,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 639 transitions. [2023-08-30 03:00:32,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:32,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:32,692 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:32,692 INFO L175 Difference]: Start difference. First operand has 107 places, 116 transitions, 1644 flow. Second operand 5 states and 639 transitions. [2023-08-30 03:00:32,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 237 transitions, 3763 flow [2023-08-30 03:00:33,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 237 transitions, 3543 flow, removed 83 selfloop flow, removed 4 redundant places. [2023-08-30 03:00:33,237 INFO L231 Difference]: Finished difference. Result has 110 places, 94 transitions, 1271 flow [2023-08-30 03:00:33,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=1560, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1271, PETRI_PLACES=110, PETRI_TRANSITIONS=94} [2023-08-30 03:00:33,238 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 59 predicate places. [2023-08-30 03:00:33,238 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 94 transitions, 1271 flow [2023-08-30 03:00:33,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.2) internal successors, (601), 5 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:33,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:00:33,239 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-30 03:00:33,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-30 03:00:33,239 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 03:00:33,239 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:00:33,239 INFO L85 PathProgramCache]: Analyzing trace with hash -761843989, now seen corresponding path program 2 times [2023-08-30 03:00:33,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:00:33,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768600372] [2023-08-30 03:00:33,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:00:33,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:00:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:00:33,550 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-30 03:00:33,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:00:33,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768600372] [2023-08-30 03:00:33,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768600372] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:00:33,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:00:33,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 03:00:33,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815235379] [2023-08-30 03:00:33,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:00:33,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 03:00:33,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:00:33,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 03:00:33,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 03:00:33,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 257 [2023-08-30 03:00:33,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 94 transitions, 1271 flow. Second operand has 7 states, 7 states have (on average 117.85714285714286) internal successors, (825), 7 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:33,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:00:33,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 257 [2023-08-30 03:00:33,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:00:34,003 INFO L130 PetriNetUnfolder]: 1850/3243 cut-off events. [2023-08-30 03:00:34,003 INFO L131 PetriNetUnfolder]: For 33359/33972 co-relation queries the response was YES. [2023-08-30 03:00:34,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20681 conditions, 3243 events. 1850/3243 cut-off events. For 33359/33972 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 21610 event pairs, 115 based on Foata normal form. 431/3593 useless extension candidates. Maximal degree in co-relation 20643. Up to 1174 conditions per place. [2023-08-30 03:00:34,017 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 32 selfloop transitions, 17 changer transitions 223/276 dead transitions. [2023-08-30 03:00:34,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 276 transitions, 4675 flow [2023-08-30 03:00:34,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 03:00:34,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 03:00:34,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1233 transitions. [2023-08-30 03:00:34,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47976653696498056 [2023-08-30 03:00:34,018 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1233 transitions. [2023-08-30 03:00:34,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1233 transitions. [2023-08-30 03:00:34,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:00:34,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1233 transitions. [2023-08-30 03:00:34,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 123.3) internal successors, (1233), 10 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:34,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 257.0) internal successors, (2827), 11 states have internal predecessors, (2827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:34,022 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 257.0) internal successors, (2827), 11 states have internal predecessors, (2827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:34,022 INFO L175 Difference]: Start difference. First operand has 110 places, 94 transitions, 1271 flow. Second operand 10 states and 1233 transitions. [2023-08-30 03:00:34,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 276 transitions, 4675 flow [2023-08-30 03:00:34,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 276 transitions, 4546 flow, removed 56 selfloop flow, removed 8 redundant places. [2023-08-30 03:00:34,085 INFO L231 Difference]: Finished difference. Result has 110 places, 40 transitions, 414 flow [2023-08-30 03:00:34,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=1215, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=414, PETRI_PLACES=110, PETRI_TRANSITIONS=40} [2023-08-30 03:00:34,085 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 59 predicate places. [2023-08-30 03:00:34,085 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 40 transitions, 414 flow [2023-08-30 03:00:34,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.85714285714286) internal successors, (825), 7 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:34,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:00:34,086 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-30 03:00:34,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-30 03:00:34,086 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 03:00:34,086 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:00:34,086 INFO L85 PathProgramCache]: Analyzing trace with hash -608249947, now seen corresponding path program 1 times [2023-08-30 03:00:34,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:00:34,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931521413] [2023-08-30 03:00:34,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:00:34,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:00:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:00:34,121 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 03:00:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:00:34,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 03:00:34,183 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 03:00:34,184 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-30 03:00:34,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-30 03:00:34,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-30 03:00:34,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-30 03:00:34,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-30 03:00:34,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-30 03:00:34,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-30 03:00:34,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-30 03:00:34,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-30 03:00:34,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-30 03:00:34,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-30 03:00:34,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-30 03:00:34,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-30 03:00:34,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-30 03:00:34,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-30 03:00:34,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-30 03:00:34,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-30 03:00:34,190 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:00:34,194 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 03:00:34,195 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 03:00:34,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 03:00:34 BasicIcfg [2023-08-30 03:00:34,274 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 03:00:34,275 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 03:00:34,275 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 03:00:34,275 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 03:00:34,275 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:59:36" (3/4) ... [2023-08-30 03:00:34,278 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 03:00:34,278 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 03:00:34,278 INFO L158 Benchmark]: Toolchain (without parser) took 58886.98ms. Allocated memory was 69.2MB in the beginning and 4.6GB in the end (delta: 4.5GB). Free memory was 43.4MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 882.6MB. Max. memory is 16.1GB. [2023-08-30 03:00:34,279 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 56.6MB. Free memory was 34.6MB in the beginning and 34.6MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:00:34,279 INFO L158 Benchmark]: CACSL2BoogieTranslator took 586.50ms. Allocated memory is still 69.2MB. Free memory was 43.2MB in the beginning and 37.3MB in the end (delta: 5.9MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2023-08-30 03:00:34,279 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.49ms. Allocated memory is still 69.2MB. Free memory was 37.3MB in the beginning and 34.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 03:00:34,279 INFO L158 Benchmark]: Boogie Preprocessor took 55.33ms. Allocated memory is still 69.2MB. Free memory was 34.5MB in the beginning and 32.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:00:34,280 INFO L158 Benchmark]: RCFGBuilder took 693.86ms. Allocated memory is still 69.2MB. Free memory was 32.4MB in the beginning and 40.5MB in the end (delta: -8.1MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2023-08-30 03:00:34,280 INFO L158 Benchmark]: TraceAbstraction took 57463.69ms. Allocated memory was 69.2MB in the beginning and 4.6GB in the end (delta: 4.5GB). Free memory was 39.8MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 878.1MB. Max. memory is 16.1GB. [2023-08-30 03:00:34,280 INFO L158 Benchmark]: Witness Printer took 3.01ms. Allocated memory is still 4.6GB. Free memory is still 3.7GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:00:34,282 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 56.6MB. Free memory was 34.6MB in the beginning and 34.6MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 586.50ms. Allocated memory is still 69.2MB. Free memory was 43.2MB in the beginning and 37.3MB in the end (delta: 5.9MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.49ms. Allocated memory is still 69.2MB. Free memory was 37.3MB in the beginning and 34.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.33ms. Allocated memory is still 69.2MB. Free memory was 34.5MB in the beginning and 32.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 693.86ms. Allocated memory is still 69.2MB. Free memory was 32.4MB in the beginning and 40.5MB in the end (delta: -8.1MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. * TraceAbstraction took 57463.69ms. Allocated memory was 69.2MB in the beginning and 4.6GB in the end (delta: 4.5GB). Free memory was 39.8MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 878.1MB. Max. memory is 16.1GB. * Witness Printer took 3.01ms. Allocated memory is still 4.6GB. Free memory is still 3.7GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 144 PlacesBefore, 51 PlacesAfterwards, 133 TransitionsBefore, 39 TransitionsAfterwards, 3046 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 120 TotalNumberOfCompositions, 8042 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3777, independent: 3569, independent conditional: 0, independent unconditional: 3569, dependent: 208, dependent conditional: 0, dependent unconditional: 208, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1604, independent: 1571, independent conditional: 0, independent unconditional: 1571, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3777, independent: 1998, independent conditional: 0, independent unconditional: 1998, dependent: 175, dependent conditional: 0, dependent unconditional: 175, unknown: 1604, unknown conditional: 0, unknown unconditional: 1604] , Statistics on independence cache: Total cache size (in pairs): 180, Positive cache size: 166, Positive conditional cache size: 0, Positive unconditional cache size: 166, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff0_thd3; [L729] 0 _Bool z$r_buff0_thd4; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$r_buff1_thd4; [L735] 0 _Bool z$read_delayed; [L736] 0 int *z$read_delayed_var; [L737] 0 int z$w_buff0; [L738] 0 _Bool z$w_buff0_used; [L739] 0 int z$w_buff1; [L740] 0 _Bool z$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1517; [L835] FCALL, FORK 0 pthread_create(&t1517, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1517, ((void *)0), P0, ((void *)0))=-2, t1517={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L836] 0 pthread_t t1518; [L837] FCALL, FORK 0 pthread_create(&t1518, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1518, ((void *)0), P1, ((void *)0))=-1, t1517={5:0}, t1518={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L838] 0 pthread_t t1519; [L839] FCALL, FORK 0 pthread_create(&t1519, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1519, ((void *)0), P2, ((void *)0))=0, t1517={5:0}, t1518={6:0}, t1519={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L840] 0 pthread_t t1520; [L841] FCALL, FORK 0 pthread_create(&t1520, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1520, ((void *)0), P3, ((void *)0))=1, t1517={5:0}, t1518={6:0}, t1519={7:0}, t1520={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L800] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L800] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L746] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L761] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L779] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L782] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 4 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=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, t1517={5:0}, t1518={6:0}, t1519={7:0}, t1520={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 [L869] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 837]: 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: 841]: 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: 839]: 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: 835]: 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, 171 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: 57.3s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 41.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1584 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1279 mSDsluCounter, 809 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 650 mSDsCounter, 310 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4014 IncrementalHoareTripleChecker+Invalid, 4324 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 310 mSolverCounterUnsat, 159 mSDtfsCounter, 4014 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2492occurred in iteration=18, InterpolantAutomatonStates: 152, 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, 10.2s InterpolantComputationTime, 384 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 335 ConstructedInterpolants, 0 QuantifiedInterpolants, 3160 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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-30 03:00:34,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a650c00976061981bc34910bafee4d11d94c16289374f008af5a1f8d17e97036 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 03:00:36,624 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 03:00:36,626 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 03:00:36,665 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 03:00:36,665 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 03:00:36,668 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 03:00:36,670 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 03:00:36,672 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 03:00:36,675 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 03:00:36,679 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 03:00:36,680 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 03:00:36,682 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 03:00:36,682 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 03:00:36,684 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 03:00:36,686 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 03:00:36,691 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 03:00:36,692 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 03:00:36,693 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 03:00:36,697 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 03:00:36,702 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 03:00:36,712 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 03:00:36,713 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 03:00:36,714 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 03:00:36,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 03:00:36,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 03:00:36,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 03:00:36,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 03:00:36,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 03:00:36,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 03:00:36,720 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 03:00:36,720 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 03:00:36,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 03:00:36,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 03:00:36,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 03:00:36,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 03:00:36,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 03:00:36,723 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 03:00:36,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 03:00:36,724 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 03:00:36,727 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 03:00:36,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 03:00:36,730 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-30 03:00:36,766 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 03:00:36,767 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 03:00:36,768 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 03:00:36,768 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 03:00:36,769 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 03:00:36,769 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 03:00:36,770 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 03:00:36,770 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 03:00:36,770 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 03:00:36,770 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 03:00:36,771 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 03:00:36,771 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 03:00:36,772 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 03:00:36,772 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 03:00:36,772 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 03:00:36,772 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 03:00:36,772 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 03:00:36,773 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 03:00:36,773 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 03:00:36,773 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 03:00:36,773 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 03:00:36,773 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 03:00:36,774 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 03:00:36,774 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 03:00:36,774 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 03:00:36,774 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 03:00:36,774 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 03:00:36,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:00:36,775 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 03:00:36,775 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 03:00:36,775 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 03:00:36,775 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 03:00:36,776 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 03:00:36,776 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 03:00:36,776 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 03:00:36,776 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 03:00:36,777 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 03:00:36,777 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 -> a650c00976061981bc34910bafee4d11d94c16289374f008af5a1f8d17e97036 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 -> TOGETHER [2023-08-30 03:00:37,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 03:00:37,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 03:00:37,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 03:00:37,127 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 03:00:37,128 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 03:00:37,129 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-30 03:00:38,424 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 03:00:38,683 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 03:00:38,683 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-30 03:00:38,703 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/831d62466/97f320dfa414456aaf70e53c9c068b39/FLAG125e5760c [2023-08-30 03:00:38,721 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/831d62466/97f320dfa414456aaf70e53c9c068b39 [2023-08-30 03:00:38,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 03:00:38,724 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 03:00:38,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 03:00:38,727 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 03:00:38,730 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 03:00:38,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:00:38" (1/1) ... [2023-08-30 03:00:38,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6844b9de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:00:38, skipping insertion in model container [2023-08-30 03:00:38,733 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:00:38" (1/1) ... [2023-08-30 03:00:38,745 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 03:00:38,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 03:00:38,905 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2023-08-30 03:00:39,118 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:00:39,130 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 03:00:39,142 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2023-08-30 03:00:39,186 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:00:39,231 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:00:39,231 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:00:39,237 INFO L208 MainTranslator]: Completed translation [2023-08-30 03:00:39,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:00:39 WrapperNode [2023-08-30 03:00:39,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 03:00:39,239 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 03:00:39,239 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 03:00:39,239 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 03:00:39,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:00:39" (1/1) ... [2023-08-30 03:00:39,273 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:00:39" (1/1) ... [2023-08-30 03:00:39,309 INFO L138 Inliner]: procedures = 180, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2023-08-30 03:00:39,310 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 03:00:39,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 03:00:39,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 03:00:39,310 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 03:00:39,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:00:39" (1/1) ... [2023-08-30 03:00:39,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:00:39" (1/1) ... [2023-08-30 03:00:39,336 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:00:39" (1/1) ... [2023-08-30 03:00:39,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:00:39" (1/1) ... [2023-08-30 03:00:39,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:00:39" (1/1) ... [2023-08-30 03:00:39,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:00:39" (1/1) ... [2023-08-30 03:00:39,359 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:00:39" (1/1) ... [2023-08-30 03:00:39,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:00:39" (1/1) ... [2023-08-30 03:00:39,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 03:00:39,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 03:00:39,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 03:00:39,365 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 03:00:39,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:00:39" (1/1) ... [2023-08-30 03:00:39,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:00:39,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 03:00:39,414 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-30 03:00:39,441 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-30 03:00:39,456 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 03:00:39,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 03:00:39,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 03:00:39,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 03:00:39,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 03:00:39,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 03:00:39,457 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 03:00:39,457 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 03:00:39,457 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 03:00:39,457 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 03:00:39,458 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 03:00:39,458 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 03:00:39,458 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 03:00:39,458 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 03:00:39,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 03:00:39,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 03:00:39,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 03:00:39,460 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 03:00:39,676 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 03:00:39,677 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 03:00:40,026 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 03:00:40,172 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 03:00:40,173 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 03:00:40,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:00:40 BoogieIcfgContainer [2023-08-30 03:00:40,175 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 03:00:40,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 03:00:40,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 03:00:40,181 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 03:00:40,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 03:00:38" (1/3) ... [2023-08-30 03:00:40,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a6db2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:00:40, skipping insertion in model container [2023-08-30 03:00:40,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:00:39" (2/3) ... [2023-08-30 03:00:40,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a6db2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:00:40, skipping insertion in model container [2023-08-30 03:00:40,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:00:40" (3/3) ... [2023-08-30 03:00:40,185 INFO L112 eAbstractionObserver]: Analyzing ICFG mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-30 03:00:40,201 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 03:00:40,202 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-30 03:00:40,202 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 03:00:40,280 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 03:00:40,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 138 transitions, 296 flow [2023-08-30 03:00:40,394 INFO L130 PetriNetUnfolder]: 2/134 cut-off events. [2023-08-30 03:00:40,394 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:00:40,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 2/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 96 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-08-30 03:00:40,400 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 138 transitions, 296 flow [2023-08-30 03:00:40,407 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 134 transitions, 280 flow [2023-08-30 03:00:40,410 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 03:00:40,426 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 134 transitions, 280 flow [2023-08-30 03:00:40,429 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 134 transitions, 280 flow [2023-08-30 03:00:40,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 134 transitions, 280 flow [2023-08-30 03:00:40,479 INFO L130 PetriNetUnfolder]: 2/134 cut-off events. [2023-08-30 03:00:40,480 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:00:40,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 2/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-08-30 03:00:40,485 INFO L119 LiptonReduction]: Number of co-enabled transitions 3046 [2023-08-30 03:00:47,955 INFO L134 LiptonReduction]: Checked pairs total: 6925 [2023-08-30 03:00:47,956 INFO L136 LiptonReduction]: Total number of compositions: 129 [2023-08-30 03:00:47,976 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 03:00:47,981 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;@7ec3c4d0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 03:00:47,981 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-30 03:00:47,983 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 03:00:47,983 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:00:47,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:00:47,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 03:00:47,984 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 03:00:48,002 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:00:48,003 INFO L85 PathProgramCache]: Analyzing trace with hash 570, now seen corresponding path program 1 times [2023-08-30 03:00:48,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:00:48,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1891128537] [2023-08-30 03:00:48,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:00:48,053 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-30 03:00:48,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:00:48,057 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-30 03:00:48,059 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-30 03:00:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:00:48,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 03:00:48,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:00:48,129 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-30 03:00:48,129 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:00:48,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:00:48,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1891128537] [2023-08-30 03:00:48,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1891128537] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:00:48,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:00:48,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 03:00:48,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942641988] [2023-08-30 03:00:48,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:00:48,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 03:00:48,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:00:48,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 03:00:48,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 03:00:48,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 267 [2023-08-30 03:00:48,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 84 flow. Second operand has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:48,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:00:48,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 267 [2023-08-30 03:00:48,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:00:48,998 INFO L130 PetriNetUnfolder]: 3113/4342 cut-off events. [2023-08-30 03:00:48,999 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2023-08-30 03:00:49,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8736 conditions, 4342 events. 3113/4342 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 21691 event pairs, 3113 based on Foata normal form. 0/3726 useless extension candidates. Maximal degree in co-relation 8724. Up to 4291 conditions per place. [2023-08-30 03:00:49,035 INFO L137 encePairwiseOnDemand]: 259/267 looper letters, 24 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2023-08-30 03:00:49,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 28 transitions, 116 flow [2023-08-30 03:00:49,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 03:00:49,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 03:00:49,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 282 transitions. [2023-08-30 03:00:49,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5280898876404494 [2023-08-30 03:00:49,055 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 282 transitions. [2023-08-30 03:00:49,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 282 transitions. [2023-08-30 03:00:49,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:00:49,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 282 transitions. [2023-08-30 03:00:49,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 141.0) internal successors, (282), 2 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:49,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:49,072 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:49,074 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 84 flow. Second operand 2 states and 282 transitions. [2023-08-30 03:00:49,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 28 transitions, 116 flow [2023-08-30 03:00:49,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 28 transitions, 112 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 03:00:49,078 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 64 flow [2023-08-30 03:00:49,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2023-08-30 03:00:49,094 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -11 predicate places. [2023-08-30 03:00:49,095 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 64 flow [2023-08-30 03:00:49,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:49,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:00:49,095 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:00:49,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-30 03:00:49,304 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-30 03:00:49,304 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 03:00:49,305 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:00:49,305 INFO L85 PathProgramCache]: Analyzing trace with hash -2127768749, now seen corresponding path program 1 times [2023-08-30 03:00:49,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:00:49,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [248608041] [2023-08-30 03:00:49,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:00:49,307 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-30 03:00:49,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:00:49,308 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-30 03:00:49,312 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-30 03:00:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:00:49,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:00:49,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:00:49,439 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-30 03:00:49,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:00:49,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:00:49,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [248608041] [2023-08-30 03:00:49,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [248608041] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:00:49,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:00:49,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:00:49,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157533626] [2023-08-30 03:00:49,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:00:49,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:00:49,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:00:49,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:00:49,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:00:49,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 267 [2023-08-30 03:00:49,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:49,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:00:49,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 267 [2023-08-30 03:00:49,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:00:49,942 INFO L130 PetriNetUnfolder]: 2483/3685 cut-off events. [2023-08-30 03:00:49,943 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:00:49,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7230 conditions, 3685 events. 2483/3685 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 20243 event pairs, 593 based on Foata normal form. 0/3384 useless extension candidates. Maximal degree in co-relation 7227. Up to 2539 conditions per place. [2023-08-30 03:00:49,962 INFO L137 encePairwiseOnDemand]: 264/267 looper letters, 31 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2023-08-30 03:00:49,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 39 transitions, 156 flow [2023-08-30 03:00:49,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:00:49,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:00:49,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2023-08-30 03:00:49,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5093632958801498 [2023-08-30 03:00:49,965 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 408 transitions. [2023-08-30 03:00:49,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 408 transitions. [2023-08-30 03:00:49,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:00:49,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 408 transitions. [2023-08-30 03:00:49,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:49,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:49,969 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:49,969 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 64 flow. Second operand 3 states and 408 transitions. [2023-08-30 03:00:49,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 39 transitions, 156 flow [2023-08-30 03:00:49,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 156 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 03:00:49,971 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 64 flow [2023-08-30 03:00:49,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2023-08-30 03:00:49,972 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -10 predicate places. [2023-08-30 03:00:49,972 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 64 flow [2023-08-30 03:00:49,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:49,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:00:49,973 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:00:49,988 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-30 03:00:50,182 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-30 03:00:50,184 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 03:00:50,186 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:00:50,186 INFO L85 PathProgramCache]: Analyzing trace with hash -381266525, now seen corresponding path program 1 times [2023-08-30 03:00:50,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:00:50,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905089180] [2023-08-30 03:00:50,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:00:50,188 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-30 03:00:50,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:00:50,189 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-30 03:00:50,192 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-30 03:00:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:00:50,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:00:50,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:00:50,365 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-30 03:00:50,365 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:00:50,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:00:50,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905089180] [2023-08-30 03:00:50,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905089180] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:00:50,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:00:50,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:00:50,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136179395] [2023-08-30 03:00:50,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:00:50,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:00:50,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:00:50,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:00:50,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:00:50,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 267 [2023-08-30 03:00:50,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:50,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:00:50,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 267 [2023-08-30 03:00:50,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:00:50,822 INFO L130 PetriNetUnfolder]: 1799/2641 cut-off events. [2023-08-30 03:00:50,822 INFO L131 PetriNetUnfolder]: For 156/156 co-relation queries the response was YES. [2023-08-30 03:00:50,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5528 conditions, 2641 events. 1799/2641 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13197 event pairs, 365 based on Foata normal form. 144/2670 useless extension candidates. Maximal degree in co-relation 5524. Up to 2001 conditions per place. [2023-08-30 03:00:50,835 INFO L137 encePairwiseOnDemand]: 260/267 looper letters, 33 selfloop transitions, 5 changer transitions 21/63 dead transitions. [2023-08-30 03:00:50,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 63 transitions, 268 flow [2023-08-30 03:00:50,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:00:50,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:00:50,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 656 transitions. [2023-08-30 03:00:50,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49138576779026216 [2023-08-30 03:00:50,838 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 656 transitions. [2023-08-30 03:00:50,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 656 transitions. [2023-08-30 03:00:50,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:00:50,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 656 transitions. [2023-08-30 03:00:50,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:50,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:50,844 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:50,844 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 64 flow. Second operand 5 states and 656 transitions. [2023-08-30 03:00:50,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 63 transitions, 268 flow [2023-08-30 03:00:50,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 63 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:00:50,847 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 105 flow [2023-08-30 03:00:50,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=105, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-08-30 03:00:50,848 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -6 predicate places. [2023-08-30 03:00:50,848 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 105 flow [2023-08-30 03:00:50,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:50,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:00:50,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:00:50,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-30 03:00:51,058 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-30 03:00:51,059 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 03:00:51,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:00:51,059 INFO L85 PathProgramCache]: Analyzing trace with hash -916705910, now seen corresponding path program 1 times [2023-08-30 03:00:51,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:00:51,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26707340] [2023-08-30 03:00:51,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:00:51,060 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:00:51,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:00:51,061 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-30 03:00:51,064 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-30 03:00:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:00:51,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 03:00:51,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:00:51,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:00:51,201 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:00:51,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:00:51,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26707340] [2023-08-30 03:00:51,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26707340] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:00:51,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:00:51,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:00:51,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387154990] [2023-08-30 03:00:51,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:00:51,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:00:51,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:00:51,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:00:51,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:00:51,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 267 [2023-08-30 03:00:51,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 105 flow. Second operand has 5 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:51,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:00:51,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 267 [2023-08-30 03:00:51,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:00:51,554 INFO L130 PetriNetUnfolder]: 995/1561 cut-off events. [2023-08-30 03:00:51,554 INFO L131 PetriNetUnfolder]: For 664/664 co-relation queries the response was YES. [2023-08-30 03:00:51,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4391 conditions, 1561 events. 995/1561 cut-off events. For 664/664 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7517 event pairs, 149 based on Foata normal form. 108/1614 useless extension candidates. Maximal degree in co-relation 4384. Up to 751 conditions per place. [2023-08-30 03:00:51,563 INFO L137 encePairwiseOnDemand]: 260/267 looper letters, 43 selfloop transitions, 9 changer transitions 21/77 dead transitions. [2023-08-30 03:00:51,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 77 transitions, 405 flow [2023-08-30 03:00:51,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 03:00:51,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 03:00:51,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 789 transitions. [2023-08-30 03:00:51,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49250936329588013 [2023-08-30 03:00:51,566 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 789 transitions. [2023-08-30 03:00:51,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 789 transitions. [2023-08-30 03:00:51,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:00:51,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 789 transitions. [2023-08-30 03:00:51,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.5) internal successors, (789), 6 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:51,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:51,572 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:51,572 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 105 flow. Second operand 6 states and 789 transitions. [2023-08-30 03:00:51,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 77 transitions, 405 flow [2023-08-30 03:00:51,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 77 transitions, 398 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 03:00:51,578 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 170 flow [2023-08-30 03:00:51,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=170, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2023-08-30 03:00:51,579 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2023-08-30 03:00:51,579 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 170 flow [2023-08-30 03:00:51,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:51,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:00:51,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:00:51,593 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-30 03:00:51,792 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-30 03:00:51,793 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 03:00:51,793 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:00:51,793 INFO L85 PathProgramCache]: Analyzing trace with hash 662297077, now seen corresponding path program 1 times [2023-08-30 03:00:51,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:00:51,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [901863543] [2023-08-30 03:00:51,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:00:51,794 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-30 03:00:51,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:00:51,795 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-30 03:00:51,798 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-30 03:00:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:00:51,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 03:00:51,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:00:51,940 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-30 03:00:51,941 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:00:51,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:00:51,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [901863543] [2023-08-30 03:00:51,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [901863543] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:00:51,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:00:51,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:00:51,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800983841] [2023-08-30 03:00:51,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:00:51,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:00:51,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:00:51,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:00:51,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:00:51,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 267 [2023-08-30 03:00:51,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 170 flow. Second operand has 6 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:51,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:00:51,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 267 [2023-08-30 03:00:51,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:00:52,290 INFO L130 PetriNetUnfolder]: 556/914 cut-off events. [2023-08-30 03:00:52,291 INFO L131 PetriNetUnfolder]: For 1041/1041 co-relation queries the response was YES. [2023-08-30 03:00:52,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3029 conditions, 914 events. 556/914 cut-off events. For 1041/1041 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3976 event pairs, 103 based on Foata normal form. 48/944 useless extension candidates. Maximal degree in co-relation 3020. Up to 347 conditions per place. [2023-08-30 03:00:52,297 INFO L137 encePairwiseOnDemand]: 260/267 looper letters, 51 selfloop transitions, 13 changer transitions 21/89 dead transitions. [2023-08-30 03:00:52,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 89 transitions, 562 flow [2023-08-30 03:00:52,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:00:52,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:00:52,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 920 transitions. [2023-08-30 03:00:52,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4922418405564473 [2023-08-30 03:00:52,301 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 920 transitions. [2023-08-30 03:00:52,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 920 transitions. [2023-08-30 03:00:52,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:00:52,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 920 transitions. [2023-08-30 03:00:52,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.42857142857142) internal successors, (920), 7 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:52,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 267.0) internal successors, (2136), 8 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:52,308 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 267.0) internal successors, (2136), 8 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:52,308 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 170 flow. Second operand 7 states and 920 transitions. [2023-08-30 03:00:52,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 89 transitions, 562 flow [2023-08-30 03:00:52,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 89 transitions, 500 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-30 03:00:52,317 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 220 flow [2023-08-30 03:00:52,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=220, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2023-08-30 03:00:52,318 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 1 predicate places. [2023-08-30 03:00:52,318 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 220 flow [2023-08-30 03:00:52,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:52,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:00:52,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:00:52,335 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-30 03:00:52,530 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-30 03:00:52,530 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 03:00:52,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:00:52,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1509440314, now seen corresponding path program 1 times [2023-08-30 03:00:52,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:00:52,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040115485] [2023-08-30 03:00:52,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:00:52,531 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-30 03:00:52,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:00:52,533 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-30 03:00:52,535 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-30 03:00:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:00:52,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 03:00:52,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:00:52,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-30 03:00:52,698 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:00:52,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:00:52,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040115485] [2023-08-30 03:00:52,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040115485] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:00:52,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:00:52,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 03:00:52,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280610422] [2023-08-30 03:00:52,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:00:52,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 03:00:52,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:00:52,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 03:00:52,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-30 03:00:52,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 267 [2023-08-30 03:00:52,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 220 flow. Second operand has 7 states, 7 states have (on average 121.57142857142857) internal successors, (851), 7 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:52,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:00:52,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 267 [2023-08-30 03:00:52,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:00:53,125 INFO L130 PetriNetUnfolder]: 452/733 cut-off events. [2023-08-30 03:00:53,125 INFO L131 PetriNetUnfolder]: For 816/816 co-relation queries the response was YES. [2023-08-30 03:00:53,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2325 conditions, 733 events. 452/733 cut-off events. For 816/816 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3050 event pairs, 99 based on Foata normal form. 11/736 useless extension candidates. Maximal degree in co-relation 2315. Up to 290 conditions per place. [2023-08-30 03:00:53,130 INFO L137 encePairwiseOnDemand]: 260/267 looper letters, 47 selfloop transitions, 17 changer transitions 11/79 dead transitions. [2023-08-30 03:00:53,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 79 transitions, 510 flow [2023-08-30 03:00:53,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 03:00:53,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 03:00:53,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1029 transitions. [2023-08-30 03:00:53,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48174157303370785 [2023-08-30 03:00:53,135 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1029 transitions. [2023-08-30 03:00:53,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1029 transitions. [2023-08-30 03:00:53,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:00:53,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1029 transitions. [2023-08-30 03:00:53,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 128.625) internal successors, (1029), 8 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:53,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:53,142 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:53,142 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 220 flow. Second operand 8 states and 1029 transitions. [2023-08-30 03:00:53,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 79 transitions, 510 flow [2023-08-30 03:00:53,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 79 transitions, 448 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-30 03:00:53,149 INFO L231 Difference]: Finished difference. Result has 53 places, 38 transitions, 214 flow [2023-08-30 03:00:53,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=214, PETRI_PLACES=53, PETRI_TRANSITIONS=38} [2023-08-30 03:00:53,149 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2023-08-30 03:00:53,150 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 214 flow [2023-08-30 03:00:53,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.57142857142857) internal successors, (851), 7 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:53,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:00:53,150 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] [2023-08-30 03:00:53,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 (7)] Forceful destruction successful, exit code 0 [2023-08-30 03:00:53,361 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-30 03:00:53,362 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 03:00:53,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:00:53,362 INFO L85 PathProgramCache]: Analyzing trace with hash 130698134, now seen corresponding path program 1 times [2023-08-30 03:00:53,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:00:53,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [862707058] [2023-08-30 03:00:53,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:00:53,363 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-30 03:00:53,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:00:53,364 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-30 03:00:53,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 (8)] Waiting until timeout for monitored process [2023-08-30 03:00:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:00:53,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-30 03:00:53,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:00:54,078 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-30 03:00:54,078 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:00:54,079 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:00:54,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [862707058] [2023-08-30 03:00:54,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [862707058] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:00:54,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:00:54,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:00:54,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475647315] [2023-08-30 03:00:54,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:00:54,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:00:54,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:00:54,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:00:54,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:00:54,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 267 [2023-08-30 03:00:54,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 38 transitions, 214 flow. Second operand has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:54,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:00:54,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 267 [2023-08-30 03:00:54,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:00:54,989 INFO L130 PetriNetUnfolder]: 443/733 cut-off events. [2023-08-30 03:00:54,990 INFO L131 PetriNetUnfolder]: For 1152/1152 co-relation queries the response was YES. [2023-08-30 03:00:54,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2258 conditions, 733 events. 443/733 cut-off events. For 1152/1152 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3364 event pairs, 9 based on Foata normal form. 0/733 useless extension candidates. Maximal degree in co-relation 2247. Up to 558 conditions per place. [2023-08-30 03:00:54,999 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 50 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2023-08-30 03:00:55,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 58 transitions, 443 flow [2023-08-30 03:00:55,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 03:00:55,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 03:00:55,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 665 transitions. [2023-08-30 03:00:55,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4151061173533084 [2023-08-30 03:00:55,005 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 665 transitions. [2023-08-30 03:00:55,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 665 transitions. [2023-08-30 03:00:55,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:00:55,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 665 transitions. [2023-08-30 03:00:55,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 110.83333333333333) internal successors, (665), 6 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:55,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:55,013 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:55,013 INFO L175 Difference]: Start difference. First operand has 53 places, 38 transitions, 214 flow. Second operand 6 states and 665 transitions. [2023-08-30 03:00:55,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 58 transitions, 443 flow [2023-08-30 03:00:55,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 354 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-08-30 03:00:55,018 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 156 flow [2023-08-30 03:00:55,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=156, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2023-08-30 03:00:55,019 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2023-08-30 03:00:55,019 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 156 flow [2023-08-30 03:00:55,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:55,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:00:55,020 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] [2023-08-30 03:00:55,031 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-30 03:00:55,231 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-30 03:00:55,231 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 03:00:55,232 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:00:55,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1158053413, now seen corresponding path program 1 times [2023-08-30 03:00:55,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:00:55,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [785839132] [2023-08-30 03:00:55,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:00:55,233 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-30 03:00:55,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:00:55,234 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-30 03:00:55,237 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-30 03:00:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:00:55,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:00:55,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:00:55,374 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-30 03:00:55,374 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:00:55,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:00:55,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [785839132] [2023-08-30 03:00:55,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [785839132] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:00:55,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:00:55,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:00:55,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719842036] [2023-08-30 03:00:55,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:00:55,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:00:55,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:00:55,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:00:55,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:00:55,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 267 [2023-08-30 03:00:55,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:55,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:00:55,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 267 [2023-08-30 03:00:55,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:00:55,581 INFO L130 PetriNetUnfolder]: 795/1277 cut-off events. [2023-08-30 03:00:55,581 INFO L131 PetriNetUnfolder]: For 891/891 co-relation queries the response was YES. [2023-08-30 03:00:55,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3655 conditions, 1277 events. 795/1277 cut-off events. For 891/891 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6362 event pairs, 373 based on Foata normal form. 1/1265 useless extension candidates. Maximal degree in co-relation 3647. Up to 762 conditions per place. [2023-08-30 03:00:55,591 INFO L137 encePairwiseOnDemand]: 264/267 looper letters, 48 selfloop transitions, 2 changer transitions 11/64 dead transitions. [2023-08-30 03:00:55,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 64 transitions, 404 flow [2023-08-30 03:00:55,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:00:55,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:00:55,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2023-08-30 03:00:55,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5043695380774033 [2023-08-30 03:00:55,594 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 404 transitions. [2023-08-30 03:00:55,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 404 transitions. [2023-08-30 03:00:55,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:00:55,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 404 transitions. [2023-08-30 03:00:55,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:55,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:55,598 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:55,598 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 156 flow. Second operand 3 states and 404 transitions. [2023-08-30 03:00:55,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 64 transitions, 404 flow [2023-08-30 03:00:55,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 64 transitions, 394 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 03:00:55,608 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 157 flow [2023-08-30 03:00:55,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=157, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2023-08-30 03:00:55,611 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2023-08-30 03:00:55,611 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 157 flow [2023-08-30 03:00:55,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:55,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:00:55,612 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] [2023-08-30 03:00:55,626 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-30 03:00:55,824 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-30 03:00:55,824 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 03:00:55,825 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:00:55,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1848773675, now seen corresponding path program 2 times [2023-08-30 03:00:55,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:00:55,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415840785] [2023-08-30 03:00:55,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 03:00:55,826 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-30 03:00:55,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:00:55,827 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-30 03:00:55,829 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-30 03:00:55,938 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 03:00:55,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:00:55,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 03:00:55,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:00:55,993 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-30 03:00:55,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:00:55,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:00:55,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415840785] [2023-08-30 03:00:55,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [415840785] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:00:55,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:00:55,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:00:55,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265515914] [2023-08-30 03:00:55,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:00:55,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:00:55,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:00:55,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:00:55,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:00:56,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 267 [2023-08-30 03:00:56,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 157 flow. Second operand has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:56,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:00:56,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 267 [2023-08-30 03:00:56,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:00:56,187 INFO L130 PetriNetUnfolder]: 434/740 cut-off events. [2023-08-30 03:00:56,188 INFO L131 PetriNetUnfolder]: For 662/664 co-relation queries the response was YES. [2023-08-30 03:00:56,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2297 conditions, 740 events. 434/740 cut-off events. For 662/664 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3382 event pairs, 82 based on Foata normal form. 2/739 useless extension candidates. Maximal degree in co-relation 2288. Up to 413 conditions per place. [2023-08-30 03:00:56,195 INFO L137 encePairwiseOnDemand]: 264/267 looper letters, 46 selfloop transitions, 1 changer transitions 30/80 dead transitions. [2023-08-30 03:00:56,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 80 transitions, 510 flow [2023-08-30 03:00:56,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:00:56,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:00:56,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 532 transitions. [2023-08-30 03:00:56,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49812734082397003 [2023-08-30 03:00:56,198 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 532 transitions. [2023-08-30 03:00:56,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 532 transitions. [2023-08-30 03:00:56,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:00:56,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 532 transitions. [2023-08-30 03:00:56,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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-30 03:00:56,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:56,202 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:56,202 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 157 flow. Second operand 4 states and 532 transitions. [2023-08-30 03:00:56,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 80 transitions, 510 flow [2023-08-30 03:00:56,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 80 transitions, 500 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 03:00:56,212 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 158 flow [2023-08-30 03:00:56,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2023-08-30 03:00:56,214 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 1 predicate places. [2023-08-30 03:00:56,214 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 158 flow [2023-08-30 03:00:56,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:56,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:00:56,214 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] [2023-08-30 03:00:56,229 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-30 03:00:56,425 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-30 03:00:56,425 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 03:00:56,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:00:56,426 INFO L85 PathProgramCache]: Analyzing trace with hash -281867977, now seen corresponding path program 3 times [2023-08-30 03:00:56,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:00:56,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [808795444] [2023-08-30 03:00:56,426 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 03:00:56,426 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-30 03:00:56,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:00:56,428 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-30 03:00:56,430 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-30 03:00:56,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 03:00:56,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:00:56,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:00:56,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:00:56,565 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-30 03:00:56,566 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:00:56,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:00:56,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [808795444] [2023-08-30 03:00:56,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [808795444] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:00:56,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:00:56,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:00:56,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704324982] [2023-08-30 03:00:56,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:00:56,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:00:56,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:00:56,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:00:56,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:00:56,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 267 [2023-08-30 03:00:56,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:56,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:00:56,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 267 [2023-08-30 03:00:56,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:00:56,761 INFO L130 PetriNetUnfolder]: 636/1073 cut-off events. [2023-08-30 03:00:56,761 INFO L131 PetriNetUnfolder]: For 1122/1125 co-relation queries the response was YES. [2023-08-30 03:00:56,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3289 conditions, 1073 events. 636/1073 cut-off events. For 1122/1125 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5314 event pairs, 276 based on Foata normal form. 2/1060 useless extension candidates. Maximal degree in co-relation 3279. Up to 644 conditions per place. [2023-08-30 03:00:56,766 INFO L137 encePairwiseOnDemand]: 264/267 looper letters, 37 selfloop transitions, 2 changer transitions 24/66 dead transitions. [2023-08-30 03:00:56,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 414 flow [2023-08-30 03:00:56,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:00:56,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:00:56,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2023-08-30 03:00:56,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5068664169787765 [2023-08-30 03:00:56,769 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2023-08-30 03:00:56,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2023-08-30 03:00:56,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:00:56,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2023-08-30 03:00:56,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:56,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:56,772 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:56,772 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 158 flow. Second operand 3 states and 406 transitions. [2023-08-30 03:00:56,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 414 flow [2023-08-30 03:00:56,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 66 transitions, 411 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 03:00:56,780 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 163 flow [2023-08-30 03:00:56,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=163, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2023-08-30 03:00:56,781 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 1 predicate places. [2023-08-30 03:00:56,781 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 163 flow [2023-08-30 03:00:56,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:00:56,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:00:56,782 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] [2023-08-30 03:00:56,795 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-30 03:00:56,991 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-30 03:00:56,992 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 03:00:56,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:00:56,992 INFO L85 PathProgramCache]: Analyzing trace with hash 903326299, now seen corresponding path program 4 times [2023-08-30 03:00:56,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:00:56,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57811677] [2023-08-30 03:00:56,993 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 03:00:56,993 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-30 03:00:56,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:00:56,994 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-30 03:00:56,995 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-30 03:00:57,120 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 03:00:57,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-30 03:00:57,121 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 03:00:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:00:57,257 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 03:00:57,257 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 03:00:57,258 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-30 03:00:57,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-30 03:00:57,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-30 03:00:57,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-30 03:00:57,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-30 03:00:57,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-30 03:00:57,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-30 03:00:57,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-30 03:00:57,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-30 03:00:57,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-30 03:00:57,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-30 03:00:57,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-30 03:00:57,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-30 03:00:57,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-30 03:00:57,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-30 03:00:57,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-30 03:00:57,277 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-30 03:00:57,473 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-30 03:00:57,473 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:00:57,477 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 03:00:57,478 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 03:00:57,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 03:00:57 BasicIcfg [2023-08-30 03:00:57,555 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 03:00:57,555 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 03:00:57,555 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 03:00:57,555 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 03:00:57,556 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:00:40" (3/4) ... [2023-08-30 03:00:57,558 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 03:00:57,559 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 03:00:57,564 INFO L158 Benchmark]: Toolchain (without parser) took 18834.94ms. Allocated memory was 65.0MB in the beginning and 606.1MB in the end (delta: 541.1MB). Free memory was 31.4MB in the beginning and 229.1MB in the end (delta: -197.7MB). Peak memory consumption was 342.8MB. Max. memory is 16.1GB. [2023-08-30 03:00:57,564 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 52.4MB. Free memory was 30.3MB in the beginning and 30.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:00:57,564 INFO L158 Benchmark]: CACSL2BoogieTranslator took 511.02ms. Allocated memory is still 65.0MB. Free memory was 31.3MB in the beginning and 39.0MB in the end (delta: -7.7MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2023-08-30 03:00:57,565 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.68ms. Allocated memory is still 65.0MB. Free memory was 39.0MB in the beginning and 36.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:00:57,565 INFO L158 Benchmark]: Boogie Preprocessor took 53.42ms. Allocated memory is still 65.0MB. Free memory was 36.3MB in the beginning and 34.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:00:57,566 INFO L158 Benchmark]: RCFGBuilder took 811.32ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 34.0MB in the beginning and 37.5MB in the end (delta: -3.5MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2023-08-30 03:00:57,566 INFO L158 Benchmark]: TraceAbstraction took 17376.63ms. Allocated memory was 79.7MB in the beginning and 606.1MB in the end (delta: 526.4MB). Free memory was 36.8MB in the beginning and 230.2MB in the end (delta: -193.4MB). Peak memory consumption was 333.8MB. Max. memory is 16.1GB. [2023-08-30 03:00:57,566 INFO L158 Benchmark]: Witness Printer took 3.40ms. Allocated memory is still 606.1MB. Free memory is still 229.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:00:57,568 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.10ms. Allocated memory is still 52.4MB. Free memory was 30.3MB in the beginning and 30.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 511.02ms. Allocated memory is still 65.0MB. Free memory was 31.3MB in the beginning and 39.0MB in the end (delta: -7.7MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.68ms. Allocated memory is still 65.0MB. Free memory was 39.0MB in the beginning and 36.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.42ms. Allocated memory is still 65.0MB. Free memory was 36.3MB in the beginning and 34.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 811.32ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 34.0MB in the beginning and 37.5MB in the end (delta: -3.5MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * TraceAbstraction took 17376.63ms. Allocated memory was 79.7MB in the beginning and 606.1MB in the end (delta: 526.4MB). Free memory was 36.8MB in the beginning and 230.2MB in the end (delta: -193.4MB). Peak memory consumption was 333.8MB. Max. memory is 16.1GB. * Witness Printer took 3.40ms. Allocated memory is still 606.1MB. Free memory is still 229.1MB. 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.5s, 145 PlacesBefore, 49 PlacesAfterwards, 134 TransitionsBefore, 36 TransitionsAfterwards, 3046 CoEnabledTransitionPairs, 6 FixpointIterations, 52 TrivialSequentialCompositions, 66 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 129 TotalNumberOfCompositions, 6925 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3214, independent: 3045, independent conditional: 0, independent unconditional: 3045, dependent: 169, dependent conditional: 0, dependent unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1631, independent: 1587, independent conditional: 0, independent unconditional: 1587, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3214, independent: 1458, independent conditional: 0, independent unconditional: 1458, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 1631, unknown conditional: 0, unknown unconditional: 1631] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 131, Positive conditional cache size: 0, Positive unconditional cache size: 131, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff0_thd3; [L729] 0 _Bool z$r_buff0_thd4; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$r_buff1_thd4; [L735] 0 _Bool z$read_delayed; [L736] 0 int *z$read_delayed_var; [L737] 0 int z$w_buff0; [L738] 0 _Bool z$w_buff0_used; [L739] 0 int z$w_buff1; [L740] 0 _Bool z$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1517; [L835] FCALL, FORK 0 pthread_create(&t1517, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1517, ((void *)0), P0, ((void *)0))=0, t1517={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L836] 0 pthread_t t1518; [L837] FCALL, FORK 0 pthread_create(&t1518, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1518, ((void *)0), P1, ((void *)0))=1, t1517={3:0}, t1518={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L838] 0 pthread_t t1519; [L839] FCALL, FORK 0 pthread_create(&t1519, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1519, ((void *)0), P2, ((void *)0))=2, t1517={3:0}, t1518={7:0}, t1519={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L840] 0 pthread_t t1520; [L841] FCALL, FORK 0 pthread_create(&t1520, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1520, ((void *)0), P3, ((void *)0))=3, t1517={3:0}, t1518={7:0}, t1519={11:0}, t1520={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L800] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L800] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L746] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L761] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L764] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=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=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L779] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=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=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L782] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=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=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=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=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 4 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=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, t1517={3:0}, t1518={7:0}, t1519={11:0}, t1520={15:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 [L869] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 837]: 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: 841]: 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: 839]: 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: 835]: 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, 172 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: 17.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 386 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 300 mSDsluCounter, 86 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1668 IncrementalHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 18 mSDtfsCounter, 1668 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred in iteration=5, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 163 ConstructedInterpolants, 16 QuantifiedInterpolants, 1422 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1496 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 03:00:57,592 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